2403 search results - page 82 / 481 » Optimal Randomized RANSAC |
130
click to vote
JSAC
2010
15 years 1 months ago
2010
—Inspired by the biological entities’ ability to achieve reciprocity in the course of evolution, this paper considers a conjecture-based distributed learning approach that enab...
131
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Many feature detection algorithms rely on the choice of scale. In this paper, we complement standard scaleselection algorithms with spatial regularization. To this end, we formula...
130
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...
151
click to vote
SSPR
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents an optimized Hill Climbing algorithm to select a subset of features for handwritten character recognition. The search is conducted taking into account a random ...
102
click to vote
EUROPAR
2001
Springer
15 years 7 months ago
2001
Springer
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...