Sciweavers

916 search results - page 111 / 184
» Algorithm selection: a quantitative computation-intensive op...
Sort
View
ML
1998
ACM
153views Machine Learning» more  ML 1998»
15 years 2 months ago
Bayesian Landmark Learning for Mobile Robot Localization
To operate successfully in indoor environments, mobile robots must be able to localize themselves. Most current localization algorithms lack flexibility, autonomy, and often optim...
Sebastian Thrun
ICDAR
2009
IEEE
15 years 9 months ago
Temporal Order Recovery of the Scanned Handwriting
In this paper, we present a new approach to the temporal order restoration of the off-line handwriting. After the preprocessing steps of the word image, a suitable algorithm makes...
Abdelkarim Elbaati, Monji Kherallah, Abdellatif En...
EDBT
2010
ACM
141views Database» more  EDBT 2010»
15 years 8 months ago
Adaptive join processing in pipelined plans
In adaptive query processing, the way in which a query is evaluated is changed in the light of feedback obtained from the environment during query evaluation. Such feedback may, f...
Kwanchai Eurviriyanukul, Norman W. Paton, Alvaro A...
APIN
2000
120views more  APIN 2000»
15 years 2 months ago
Two-Loop Real-Coded Genetic Algorithms with Adaptive Control of Mutation Step Sizes
Genetic algorithms are adaptive methods based on natural evolution that may be used for search and optimization problems. They process a population of search space solutions with t...
Francisco Herrera, Manuel Lozano
ICCV
2001
IEEE
16 years 5 months ago
Stereo Matching by Compact Windows via Minimum Ratio Cycle
Window size and shape selection is a difficult problem in area based stereo. We propose an algorithm which chooses an appropriate window shape by optimizing over a large class of ...
Olga Veksler