250 search results - page 11 / 50 » Reorganizing compressed text |
ITCC
2003
IEEE
14 years 20 days ago
2003
IEEE
In this paper we present StarNT, a dictionary-based fast lossless text transform algorithm. With a static generic dictionary, StarNT achieves a superior compression ratio than alm...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
The increasing importance of Unicode for text encoding implies a possible doubling of data storage space and data transmission time, with a corresponding need for data compression...
MFCS
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Straight-line programs (SLPs) offer powerful text compression by representing a text T[1, u] in terms of a restricted context-free grammar of n rules, so that T can be r...
CPM
2000
Springer
13 years 11 months ago
2000
Springer
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect...
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...