Sciweavers

339 search results - page 2 / 68
» Random Sampling Techniques in Parallel Computation
Sort
View
SPAA
1993
ACM
13 years 9 months ago
On Gazit and Miller's Parallel Algorithm for Planar Separators: Achieving Greater Efficiency Through Random Sampling
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
Philip N. Klein
PODC
2006
ACM
13 years 11 months ago
Peer counting and sampling in overlay networks: random walk methods
Laurent Massoulié, Erwan Le Merrer, Anne-Ma...
ECCV
2008
Springer
14 years 7 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