Sciweavers

27 search results - page 1 / 6
» Variable-length contexts for PPM
Sort
View
PCM
2005
Springer
122views Multimedia» more  PCM 2005»
13 years 10 months ago
High Efficient Context-Based Variable Length Coding with Parallel Orientation
Abstract. Entropy coding is one of the most important techniques in video codec. Two main criteria to assess an entropy coder are coding efficiency and friendly realization charact...
Qiang Wang, Debin Zhao, Wen Gao, Siwei Ma
WWW
2009
ACM
14 years 6 months ago
Towards context-aware search by learning a very large variable length hidden markov model from search logs
Capturing the context of a user's query from the previous queries and clicks in the same session may help understand the user's information need. A context-aware approac...
Huanhuan Cao, Daxin Jiang, Jian Pei, Enhong Chen, ...
COCOON
2006
Springer
13 years 9 months ago
Finding Patterns with Variable Length Gaps or Don't Cares
In this paper we have presented new algorithms to handle the pattern matching problem where the pattern can contain variable length gaps. Given a pattern P with variable length gap...
M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, ...
DCC
2003
IEEE
14 years 4 months ago
PPM Model Cleaning
The Prediction by Partial Matching (PPM) algorithm uses a cumulative frequency count of input symbols in different contexts to estimate their probability distribution. Excellent c...
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak
ENC
2005
IEEE
13 years 11 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...