5153 search results - page 138 / 1031 » Introduction to Randomized Algorithms |
247
Voted
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
135
click to vote
SPAA
1993
ACM
15 years 6 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
115
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
104
Voted
COCO
1991
Springer
15 years 6 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
119
Voted
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...