Sciweavers

448 search results - page 73 / 90
» Fast Approximation Algorithms for Multicommodity Flow Proble...
Sort
View
ICCV
2001
IEEE
14 years 9 months ago
Stereoscopic Segmentation
We cast the problem of multiframe stereo reconstruction of a smooth shape as the global region segmentation of a collection of images of the scene. Dually, the problem of segmenti...
Anthony J. Yezzi, Stefano Soatto
ICGI
2010
Springer
13 years 5 months ago
Exact DFA Identification Using SAT Solvers
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
Marijn J. H. Heule, Sicco Verwer
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 9 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
14 years 8 days ago
A simulation-based method for aggregating Markov chains
— This paper addresses model reduction for a Markov chain on a large state space. A simulation-based framework is introduced to perform state aggregation of the Markov chain base...
Kun Deng, Prashant G. Mehta, Sean P. Meyn
ICRA
1999
IEEE
126views Robotics» more  ICRA 1999»
13 years 12 months ago
Monte Carlo Localization for Mobile Robots
Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilisticlocalization algorithms known as Monte...
Frank Dellaert, Dieter Fox, Wolfram Burgard, Sebas...