15 search results - page 2 / 3 » Pattern Matching in Huffman Encoded Texts |
DAGSTUHL
2006
13 years 7 months ago
2006
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...
CPM
2000
Springer
13 years 10 months ago
2000
Springer
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
JDA
2007
13 years 5 months ago
2007
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
FPL
2003
Springer
13 years 11 months ago
2003
Springer
Intrusion Detection Systems such as Snort scan incoming packets for evidence of security threats. The most computation-intensive part of these systems is a text search against hund...
SIGIR
1998
ACM
13 years 10 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....