Sciweavers

910 search results - page 17 / 182
» Detecting False Matches in String Matching Algorithms
Sort
View
RSA
2002
73views more  RSA 2002»
14 years 11 months ago
New and faster filters for multiple approximate string matching
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
Ricardo A. Baeza-Yates, Gonzalo Navarro
JSA
2008
124views more  JSA 2008»
14 years 11 months ago
Processor array architectures for flexible approximate string matching
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
Panagiotis D. Michailidis, Konstantinos G. Margari...
INFOCOM
2010
IEEE
14 years 10 months ago
PhishNet: Predictive Blacklisting to Detect Phishing Attacks
—Phishing has been easy and effective way for trickery and deception on the Internet. While solutions such as URL blacklisting have been effective to some degree, their reliance ...
Pawan Prakash, Manish Kumar, Ramana Rao Kompella, ...
SPIRE
2010
Springer
14 years 10 months ago
String Matching with Variable Length Gaps
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
Philip Bille, Inge Li Gørtz, Hjalte Wedel V...
GLOBECOM
2010
IEEE
14 years 9 months ago
Independent Parallel Compact Finite Automatons for Accelerating Multi-String Matching
Multi-string matching is a key technique for implementing network security applications like Network Intrusion Detection Systems (NIDS) and anti-virus scanners. Existing DFA-based ...
Yi Tang, Junchen Jiang, Xiaofei Wang, Bin Liu, Yan...