Sciweavers

318 search results - page 2 / 64
» A New Indexing Method for Approximate String Matching
Sort
View
SPIRE
2005
Springer
13 years 10 months ago
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
Luís M. S. Russo, Arlindo L. Oliveira
SPIRE
2009
Springer
13 years 11 months ago
Indexing Variable Length Substrings for Exact and Approximate Matching
We introduce two new index structures based on the q-gram index. The new structures index substrings of variable length instead of q-grams of fixed length. For both of the new ind...
Gonzalo Navarro, Leena Salmela
CPM
2000
Springer
124views Combinatorics» more  CPM 2000»
13 years 9 months ago
Indexing Text with Approximate q-Grams
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
Gonzalo Navarro, Erkki Sutinen, Jani Tanninen, Jor...
SIP
2007
13 years 6 months ago
Contactless palmprint authentication using circular gabor filter and approximated string matching
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...
J. Doublet, O. Lepetit, M. Revenu
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
12 years 8 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey