110 search results - page 1 / 22 » On Performance of Compressed Pattern Matching on VF Codes |
DCC
2011
IEEE
12 years 11 months ago
2011
IEEE
DCC
2010
IEEE
13 years 7 months ago
2010
IEEE
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
DLT
2004
13 years 5 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...
DCC
2003
IEEE
14 years 4 months ago
2003
IEEE
It is known that universal compression of strings generated by i.i.d. sources over infinite alphabets entails infinite per-symbol redundancy. Continuing previous work [1], we cons...
SPIRE
1998
Springer
13 years 8 months ago
1998
Springer
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...