150 search results - page 8 / 30 » The Minimum Description Length Principle in Coding and Model... |
COLT
2008
Springer
13 years 9 months ago
2008
Springer
We show how models for prediction with expert advice can be defined concisely and clearly using hidden Markov models (HMMs); standard HMM algorithms can then be used to efficientl...
ICIP
1995
IEEE
14 years 9 months ago
1995
IEEE
Traditionally, Markov models have not been successfully used for compression of signal data other than binary image data. Due to the fact that exact substring matches in non-binar...
WILF
2005
Springer
14 years 1 months ago
2005
Springer
Computing methods that allow the efficient and accurate processing of experimentally gathered data play a crucial role in biological research. The aim of this paper is to present a...
ITSL
2008
13 years 9 months ago
2008
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determ...