Sciweavers

250 search results - page 28 / 50
» Reorganizing compressed text
Sort
View
DCC
2010
IEEE
15 years 4 months ago
Lossless Compression Based on the Sequence Memoizer
In this work we describe a sequence compression method based on combining a Bayesian nonparametric sequence model with entropy encoding. The model, a hierarchy of Pitman-Yor proce...
Jan Gasthaus, Frank Wood, Yee Whye Teh
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
15 years 4 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
SIGIR
2011
ACM
14 years 25 days ago
Faster temporal range queries over versioned text
Versioned textual collections are collections that retain multiple versions of a document as it evolves over time. Important large-scale examples are Wikipedia and the web collect...
Jinru He, Torsten Suel
ERSHOV
2006
Springer
15 years 1 months ago
Improving Semistatic Compression Via Pair-Based Coding
In the last years, new semistatic word-based byte-oriented compressors, such as Plain and Tagged Huffman and the Dense Codes, have been used to improve the efficiency of text retri...
Nieves R. Brisaboa, Antonio Fariña, Gonzalo...
IPM
2011
71views more  IPM 2011»
14 years 1 months ago
Improving semistatic compression via phrase-based modeling
In recent years, new semistatic word-based byte-oriented text compressors, such as Tagged Huffman and those based on Dense Codes, have shown that it is possible to perform fast d...
Nieves R. Brisaboa, Antonio Fariña, Gonzalo...