58 search results - page 4 / 12 » Merging the Results of Approximate Match Operations |
PR
1998
13 years 6 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
ICRA
2005
IEEE
14 years 5 hour ago
2005
IEEE
- This paper describes a method that provides an estimated location of an outdoor vehicle relative to a digital road map using Belief Theory and Kalman filtering. Firstly, an Exten...
ICDE
2002
IEEE
14 years 7 months ago
2002
IEEE
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
ALGORITHMICA
2005
13 years 6 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...
WEA
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...