99 search results - page 8 / 20 » Speeding Up Pattern Matching by Text Compression |
109
Voted
JSAC
2006
14 years 11 months ago
2006
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....
DCC
1996
IEEE
15 years 3 months ago
1996
IEEE
We suggest a novel approach for compressing images of text documents based on building up a simple derived font from patterns in the image, and present the results of a prototype ...
105
click to vote
STACS
2009
Springer
15 years 6 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
104
click to vote
IR
2000
14 years 11 months ago
2000
Inverted index compression, block addressing and sequential search on compressed text are three techniques that have been separately developed for e cient, low-overhead text retrie...
106
click to vote
IFIPTCS
2000
15 years 3 months ago
2000
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...