2403 search results - page 15 / 481 » Optimal Randomized RANSAC |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
73
Voted
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
107
click to vote
WIOPT
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...