Joint Matrix Universal Coding of Sequences of Independent Symbols
Problems of Information Transmission
Data Compression Method Combining Properties of PPM and CTW
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Implementing the Context Tree Weighting Method for Text Compression
DCC '00 Proceedings of the Conference on Data Compression
On prediction using variable order Markov models
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
The results of an experimental study of different modifications of the context tree weighting algorithm are described. In particular, the combination of this algorithm with the well-known PPM approach is studied. For one of the considered modifications the decrease of the average (for the Calgary Corpus) coding rate is 0.091 bits compared with PPMD.