598 search results - page 31 / 120 » A random graph model for massive graphs |
FOCS
1993
IEEE
14 years 3 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
FSEN
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
SDM
2008
SIAM
14 years 11 days ago
2008
SIAM
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
FOCS
2003
IEEE
14 years 4 months ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
CVPR
2008
IEEE
15 years 29 days ago
2008
IEEE
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...