Sciweavers

250 search results - page 14 / 50
» Reorganizing compressed text
Sort
View
ENC
2005
IEEE
14 years 1 months ago
Combining Structural and Textual Contexts for Compressing Semistructured Databases
We describe a compression technique for semistructured documents, called SCMPPM, which combines the Prediction by Partial Matching technique with Structural Contexts Model (SCM) t...
Joaquín Adiego, Pablo de la Fuente, Gonzalo...
DCC
2008
IEEE
14 years 1 months ago
Adaptive Compression of Graph Structured Text
In this paper we introduce an adaptive technique for compressing small quantities of text which are organized as a rooted directed graph. We impose a constraint on the technique s...
John Gilbert, David M. Abrahamson
ESA
2011
Springer
269views Algorithms» more  ESA 2011»
12 years 7 months ago
Alphabet-Independent Compressed Text Indexing
Self-indexes can represent a text in asymptotically optimal space under the k-th order entropy model, give access to text substrings, and support indexed pattern searches. Their ti...
Djamal Belazzougui, Gonzalo Navarro
DCC
1997
IEEE
13 years 11 months ago
Text Compression Via Alphabet Re-Representation
d abstract Philip M. Long Apostol I. Natsevy Je rey Scott Vittery We consider re-representing the alphabet so that a representation of a character re ects its properties as a pr...
Philip M. Long, Apostol Natsev, Jeffrey Scott Vitt...
ACSC
2002
IEEE
14 years 11 days ago
Enhanced Word-Based Block-Sorting Text Compression
The Block Sorting process of Burrows and Wheeler can be applied to any sequence in which symbols are (or might be) conditioned upon each other. In particular, it is possible to pa...
R. Yugo Kartono Isal, Alistair Moffat, A. C. H. Ng...