2403 search results - page 74 / 481 » Optimal Randomized RANSAC |
101
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
This paper analyzes the behavior of a selectorecombinative genetic algorithm (GA) with an ideal crossover on a class of random additively decomposable problems (rADPs). Specifical...
143
click to vote
STACS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
123
click to vote
KELSI
2004
Springer
15 years 8 months ago
2004
Springer
Multiple sequence alignment (MSA) is a vital problem in biology. Optimal alignment of multiple sequences becomes impractical even for a modest number of sequences [1] since the gen...
130
click to vote
STACS
1999
Springer
15 years 7 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
143
click to vote
ECCV
1994
Springer
15 years 7 months ago
1994
Springer
A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is dened as the maximum a posteriori (MAP) probability estimate...