Sciweavers

274 search results - page 6 / 55
» On Random Sampling over Joins
Sort
View
134
Voted
ECCV
2008
Springer
16 years 5 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
111
Voted
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
15 years 7 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale
137
Voted
ICCV
2009
IEEE
15 years 1 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
213
Voted
SIGMOD
2007
ACM
112views Database» more  SIGMOD 2007»
16 years 3 months ago
A random walk approach to sampling hidden databases
A large part of the data on the World Wide Web is hidden behind form-like interfaces. These interfaces interact with a hidden backend database to provide answers to user queries. ...
Arjun Dasgupta, Gautam Das, Heikki Mannila
122
Voted
JCSS
2010
146views more  JCSS 2010»
15 years 2 months ago
Connected facility location via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...