2403 search results - page 67 / 481 » Optimal Randomized RANSAC |
132
click to vote
CRYPTO
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
144
click to vote
WSC
2008
15 years 5 months ago
2008
We are interested in computing tail probabilities for the maxima of Gaussian random fields. In this paper, we discuss two special cases: random fields defined over a finite number...
138
click to vote
ICRA
2009
IEEE
15 years 21 days ago
2009
IEEE
Contextual reasoning through graphical models such as Markov Random Fields often show superior performance against local classifiers in many domains. Unfortunately, this performanc...
125
click to vote
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
In this work, we present a common framework for seeded image segmentation algorithms that yields two of the leading methods as special cases - The Graph Cuts and the Random Walker...
140
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...