Sciweavers

24 search results - page 2 / 5
» New and faster filters for multiple approximate string match...
Sort
View
ECIR
2006
Springer
13 years 6 months ago
Filtering Obfuscated Email Spam by means of Phonetic String Matching
Rule-based email filters mainly rely on the occurrence of critical words to classify spam messages. However, perceptive obfuscation techniques can be used to elude exact pattern ma...
Valerio Freschi, Andrea Seraghiti, Alessandro Bogl...
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
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
STRINGOLOGY
2004
13 years 6 months ago
BDD-Based Analysis of Gapped q-Gram Filters
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
Marc Fontaine, Stefan Burkhardt, Juha Kärkk&a...
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 5 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
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...
Heikki Hyyrö, Gonzalo Navarro