3422 search results - page 41 / 685 » Random Subset Optimization |
165
click to vote
ICPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
ICCV
2007
IEEE
16 years 3 months ago
2007
IEEE
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
141
click to vote
FOCS
1999
IEEE
15 years 6 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
127
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...