Sciweavers

6343 search results - page 3 / 1269
» Robust consensus computation
Sort
View
ICCV
2009
IEEE
14 years 7 months ago
Exploiting uncertainty in random sample consensus
In this work, we present a technique for robust estimation, which by explicitly incorporating the inherent uncertainty of the estimation procedure, results in a more efficient rob...
Rahul Raguram, Jan-Michael Frahm, Marc Pollefeys
ECCV
2008
Springer
15 years 11 months ago
A Comparative Analysis of RANSAC Techniques Leading to Adaptive Real-Time Random Sample Consensus
The Random Sample Consensus (RANSAC) algorithm is a popular tool for robust estimation problems in computer vision, primarily due to its ability to tolerate a tremendous fraction o...
Rahul Raguram, Jan-Michael Frahm, Marc Pollefeys
PODC
1997
ACM
15 years 2 months ago
Determining Consensus Numbers
Conditions on a shared object type T are given that are both necessary and sufficient for wait-free n-process consensus to be solvable using objects of type T and registers. The co...
Eric Ruppert
SASO
2009
IEEE
15 years 4 months ago
Evolution of Probabilistic Consensus in Digital Organisms
—The complexity of distributed computing systems and their increasing interaction with the physical world impose challenging requirements in terms of adaptation, robustness, and ...
David B. Knoester, Philip K. McKinley
WDAG
2007
Springer
79views Algorithms» more  WDAG 2007»
15 years 4 months ago
A Simple Population Protocol for Fast Robust Approximate Majority
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
Dana Angluin, James Aspnes, David Eisenstat