Sciweavers

5170 search results - page 207 / 1034
» Consistency of the FastSLAM Algorithm
Sort
View
SPAA
2003
ACM
15 years 7 months ago
A practical algorithm for constructing oblivious routing schemes
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
15 years 6 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel
EMMCVPR
1999
Springer
15 years 6 months ago
A New Algorithm for Energy Minimization with Discontinuities
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
Yuri Boykov, Olga Veksler, Ramin Zabih
ECCV
2006
Springer
15 years 5 months ago
A Batch Algorithm for Implicit Non-rigid Shape and Motion Recovery
The recovery of 3D shape and camera motion for non-rigid scenes from single-camera video footage is a very important problem in computer vision. The low-rank shape model consists ...
Adrien Bartoli, Søren I. Olsen
BMCBI
2008
125views more  BMCBI 2008»
15 years 1 months ago
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohl...