237 search results - page 8 / 48 » Practical and Optimal String Matching |
DLT
2004
14 years 11 months ago
2004
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
ICNP
2006
IEEE
15 years 3 months ago
2006
IEEE
— The phenomenal growth of the Internet in the last decade and society’s increasing dependence on it has brought along, a flood of security attacks on the networking and compu...
64
Voted
PR
2002
14 years 9 months ago
2002
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de ni...
ANCS
2007
ACM
15 years 1 months ago
2007
ACM
Due to the advantages of easy re-configurability and scalability, the memory-based string matching architecture is widely adopted by network intrusion detection systems (NIDS). In...
SSDBM
2003
IEEE
15 years 2 months ago
2003
IEEE
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...