The macro model for data compression (extended abstract)
From MaRDI portal
Recommendations
Cited in
(22)- Random access in persistent strings and segment selection
- MICAI 2004: Advances in Artificial Intelligence
- scientific article; zbMATH DE number 1844683 (Why is no real title available?)
- Optimal encoding of non-stationary sources
- A theory of incremental compression
- Forty Years of Text Indexing
- Approximability of minimum AND-circuits
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
- A fully linear-time approximation algorithm for grammar-based compression
- A note on the DMC data compression scheme
- Data compression with long repeated strings
- On finding minimal length superstrings
- Compressibility of Finite Languages by Grammars
- Approximation of smallest linear tree grammar
- Approximation of grammar-based compression via recompression
- scientific article; zbMATH DE number 3910293 (Why is no real title available?)
- A \textit{really} simple approximation of smallest grammar
- scientific article; zbMATH DE number 7765406 (Why is no real title available?)
- Toward an abstract theory of data compression
- Generalized Context Modeling With Multi-Directional Structuring and MDL-Based Model Selection for Heterogeneous Data Compression
- On the compressibility of finite languages and formal proofs
- Dynamic relative compression, dynamic partial sums, and substring concatenation
This page was built for publication: The macro model for data compression (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402538)