Sciweavers

1272 search results - page 72 / 255
» Approximate Parameterized Matching
Sort
View
FCT
2003
Springer
15 years 4 months ago
Complexity of Approximating Closest Substring Problems
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
Patricia A. Evans, Andrew D. Smith
ICRA
1999
IEEE
110views Robotics» more  ICRA 1999»
15 years 3 months ago
Subpixel Localization and Uncertainty Estimation Using Occupancy Grids
We describe techniques for performing mobile robot localization using occupancy grids that allow subpixel localization and uncertainty estimation in the pixelized pose space. The ...
Clark F. Olson
VMV
2001
161views Visualization» more  VMV 2001»
15 years 18 days ago
Regularized Quadrature Filters for Local Frequency Estimation: Application to Multimodal Volume Image Registration
Multimodal image registration is a fundamental problem in medical image analysis. In this paper, we propose a novel algorithm to compute the local frequency representations of the...
Jundong Liu
ICRA
2008
IEEE
134views Robotics» more  ICRA 2008»
15 years 5 months ago
An optimal filtering algorithm for non-parametric observation models in robot localization
— The lack of a parameterized observation model in robot localization using occupancy grids requires the application of sampling-based methods, or particle filters. This work ad...
Jose-Luis Blanco, Javier Gonzalez, Juan-Antonio Fe...
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
15 years 4 months 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