254 search results - page 8 / 51 » Multiple Approximate String Matching |
113
click to vote
SIP
2007
15 years 1 months ago
2007
More and more research have been developed very recently for automatic hand recognition. This paper proposes a new method for contactless hand authentication in complex images. Ou...
IPPS
2002
IEEE
15 years 4 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
105
click to vote
ALGORITHMICA
2005
14 years 11 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...
141
click to vote
CPM
1998
Springer
15 years 3 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...