160 search results - page 11 / 32 » Improved Single and Multiple Approximate String Matching |
CVIU
2010
13 years 6 months ago
2010
Estimating motions of a multi-camera system which may not have overlapping fields of view is generally complex and computationally expensive because of the non-zero offset between...
SODA
2010
ACM
13 years 5 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
IJCAI
2003
13 years 8 months ago
2003
The problem of identifying approximately duplicate objects in databases is an essential step for the information integration process. Most existing approaches have relied on gener...
AMS
2007
Springer
14 years 27 days ago
2007
Springer
Abstract. In this this paper, we present a solution to the simultaneous localization and mapping (SLAM) problem for a robot equipped with a single perspective camera. We track extr...
STACS
2009
Springer
14 years 1 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...