2403 search results - page 70 / 481 » Optimal Randomized RANSAC |
220
click to vote
PPSN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In recent years, there has been a growing interest in addressing dynamic optimization problems (DOPs) using evolutionary algorithms (EAs). Several approaches have been de...
216
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We present a new method for classification with structured
latent variables. Our model is formulated using the
max-margin formalism in the discriminative learning literature.
We...
151
click to vote
WEA
2007
Springer
16 years 7 days ago
2007
Springer
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
147
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
In this work we provide empirical evidence that shows how a variable-length genetic algorithm (GA) can naturally evolve shorter average size populations. This reduction in chromos...
150
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...