Sciweavers

Share
115 search results - page 1 / 23
» On Performance of Compressed Pattern Matching on VF Codes
Sort
View
DCC
2010
IEEE
9 years 3 months ago
A Fast Compact Prefix Encoding for Pattern Matching in Limited Resources Devices
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 ...
S. Harrusi, Amir Averbuch, N. Rabin
DLT
2004
9 years 1 months ago
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
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...
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
DCC
2003
IEEE
9 years 11 months ago
Performance of universal codes over infinite alphabets
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...
Alon Orlitsky, Narayana P. Santhanam
SPIRE
1998
Springer
9 years 4 months ago
Direct Pattern Matching on Compressed Text
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...
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
books