17543 search results - page 3059 / 3509 » Stochastic Optimization Algorithms |
193
click to vote
SIROCCO
2010
15 years 9 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
236
click to vote
DBSEC
2006
15 years 9 months ago
2006
Abstract. Attack graph is important in defending against well-orchestrated network intrusions. However, the current analysis of attack graphs requires an algorithm to be developed ...
233
click to vote
NIPS
2001
15 years 9 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
217
click to vote
SDM
2004
SIAM
15 years 9 months ago
2004
SIAM
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
208
click to vote
IM
2003
15 years 9 months ago
2003
: Quantitative models are needed for a variety of management tasks, including (a) identification of critical variables to use for health monitoring, (b) anticipating service level...