2089 search results - page 6 / 418 » A New Problem in String Searching |
ISCA
2005
IEEE
15 years 3 months ago
2005
IEEE
Network Intrusion Detection and Prevention Systems have emerged as one of the most effective ways of providing security to those connected to the network, and at the heart of alm...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
SPIRE
2010
Springer
14 years 8 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
The Boyer-Moore algorithm uses two pre-computed tables for searching a string: skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the...
CPM
1999
Springer
15 years 1 months ago
1999
Springer
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...