Sciweavers

12 search results - page 1 / 3
» Leaf languages and string compression
Sort
View
FSTTCS
2008
Springer
13 years 4 months ago
Leaf languages and string compression
Tight connections between leafs languages and strings compressed via straight-line programs (SLPs) are established. It is shown that the compressed membership problem for a languag...
Markus Lohrey
PODS
2006
ACM
216views Database» more  PODS 2006»
14 years 3 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
COCO
2004
Springer
78views Algorithms» more  COCO 2004»
13 years 9 months ago
Language Compression and Pseudorandom Generators
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
Harry Buhrman, Troy Lee, Dieter van Melkebeek
SIAMDM
1998
89views more  SIAMDM 1998»
13 years 3 months ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky
ACL
2009
13 years 1 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