Sciweavers

27 search results - page 2 / 6
» Variable-length contexts for PPM
Sort
View
DCC
2004
IEEE
14 years 5 months ago
Variable-length contexts for PPM
Przemyslaw Skibinski, Szymon Grabowski
DCC
1995
IEEE
13 years 9 months ago
Unbounded Length Contexts for PPM
John G. Cleary, W. J. Teahan, Ian H. Witten
SPIRE
2001
Springer
13 years 10 months ago
On Compression of Parse Trees
We consider methods for compressing parse trees, especially techniques based on statistical modeling. We regard a sequence of productions corresponding to a suffix of the path fr...
Jorma Tarhio
DCC
2011
IEEE
13 years 23 days ago
Improving PPM Algorithm Using Dictionaries
—We propose a method to improve traditional character-based PPM text compression algorithms. Consider a text file as a sequence of alternating words and non-words, the basic ide...
Yichuan Hu, Jianzhong (Charlie) Zhang, Farooq Khan...
ICMCS
2006
IEEE
105views Multimedia» more  ICMCS 2006»
13 years 11 months ago
A Pattern-Search Method for H.264/AVC CAVLC Decoding
In this paper, a new implementation method is proposed for Context-Adaptive Variable Length Coding (CAVLC) used in H.264 Baseline Profile. We analyze the correlation between bit p...
Shau-Yin Tseng, Tien-Wei Hsieh