Sciweavers

18 search results - page 1 / 4
» A Simple Fast Hybrid Pattern-Matching Algorithm
Sort
View
CPM
2005
Springer
123views Combinatorics» more  CPM 2005»
13 years 10 months ago
A Simple Fast Hybrid Pattern-Matching Algorithm
Abstract. The Knuth-Morris-Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the...
Frantisek Franek, Christopher G. Jennings, William...
CORR
2011
Springer
198views Education» more  CORR 2011»
12 years 12 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski
JSAC
2006
163views more  JSAC 2006»
13 years 4 months ago
Fast and Scalable Pattern Matching for Network Intrusion Detection Systems
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packets....
Sarang Dharmapurikar, John W. Lockwood
DASFAA
2007
IEEE
221views Database» more  DASFAA 2007»
13 years 11 months ago
TwigList : Make Twig Pattern Matching Fast
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
Lu Qin, Jeffrey Xu Yu, Bolin Ding
SPIRE
1998
Springer
13 years 9 months ago
Direct Pattern Matching on Compressed Text
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...