2403 search results - page 21 / 481 » Optimal Randomized RANSAC |
120
click to vote
ICPR
2010
IEEE
15 years 4 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...
76
Voted
SAC
2004
ACM
15 years 3 months ago
2004
ACM
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
66
Voted
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
65
Voted
ICCV
2007
IEEE
15 years 11 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...
101
click to vote
FOCS
1999
IEEE
15 years 2 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...