169 search results - page 4 / 34 » Pattern Matching in Text Compressed by Using Antidictionarie... |
SIGIR
1998
ACM
13 years 11 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....
DLT
2004
13 years 8 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...
DAGSTUHL
2006
13 years 8 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...
SPIRE
2009
Springer
14 years 2 months ago
2009
Springer
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...
23
Voted
CPM
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...