2403 search results - page 136 / 481 » Optimal Randomized RANSAC |
142
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
149
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
In this paper we propose a novel technique to image completion that addresses image renaissance through a graph-based matching process. To this end, a number of candidate seeds wi...
157
click to vote
CDC
2008
IEEE
16 years 24 days ago
2008
IEEE
— This paper considers a network composed of robotic agents and static nodes performing spatial estimation of a dynamic physical processes. The physical process is modeled as a s...
186
click to vote
SECON
2008
IEEE
16 years 21 days ago
2008
IEEE
—We describe and evaluate a suite of distributed and computationally efficient algorithms for solving a class of convex optimization problems in wireless sensor networks. The pr...
235
click to vote
GLOBECOM
2006
IEEE
16 years 12 days ago
2006
IEEE
— A non-parametric, low-complexity algorithm for accurate and simultaneous localization of multiple sensors from scarce and imperfect ranging information is proposed. The techniq...