63 search results - page 10 / 13 » A sublinear algorithm for weakly approximating edit distance |
ALGORITHMICA
2005
13 years 10 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
ROBOTICA
2002
13 years 10 months ago
2002
: This paper presents an adaptation of Lowe's numerical model-based camera localisation algorithm to the domain of indoor mobile robotics. While the original method is straigh...
SIGMOD
2009
ACM
14 years 11 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
IJCAI
2003
14 years 4 days 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...
FSTTCS
2003
Springer
14 years 4 months ago
2003
Springer
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...