5 search results - page 1 / 1 » Unbounded Length Contexts for PPM |
DCC
1995
IEEE
13 years 8 months ago
1995
IEEE
DCC
2010
IEEE
13 years 11 months ago
2010
IEEE
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...
DCC
2004
IEEE
14 years 4 months ago
2004
IEEE
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
DCC
2001
IEEE
14 years 4 months ago
2001
IEEE
Lossless compression researchers have developed highly sophisticated approaches, such as Huffman encoding, arithmetic encoding, the Lempel-Ziv family, Dynamic Markov Compression (D...
WG
1994
Springer
13 years 8 months ago
1994
Springer
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...