Sciweavers

273 search results - page 21 / 55
» Compressed String Dictionaries
Sort
View
DLT
2004
13 years 9 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
SCCC
2002
IEEE
14 years 19 days ago
Improved Antidictionary Based Compression
The compression of binary texts using antidictionaries is a novel technique based on the fact that some substrings (called “antifactors”) never appear in the text. Let × be a...
Maxime Crochemore, Gonzalo Navarro
ACL
2009
13 years 5 months ago
A Succinct N-gram Language Model
Efficient processing of tera-scale text data is an important research topic. This paper proposes lossless compression of Ngram language models based on LOUDS, a succinct data stru...
Taro Watanabe, Hajime Tsukada, Hideki Isozaki
SIGPRO
2010
137views more  SIGPRO 2010»
13 years 6 months ago
Satellite image compression by post-transforms in the wavelet domain
This paper proposes a novel compression scheme with a tunable complexity-ratedistortion trade-off. As images increase in size and resolution, more efficient compression schemes w...
Xavier Delaunay, Marie Chabert, Vincent Charvillat...
POPL
2008
ACM
14 years 8 months ago
Boomerang: resourceful lenses for string data
A lens is a bidirectional program. When read from left to right, it denotes an ordinary function that maps inputs to outputs. When read from right to left, it denotes an "upd...
Aaron Bohannon, J. Nathan Foster, Benjamin C. Pier...