815 search results - page 6 / 163 » Approximate Entropy Reducts |
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
We study the entropy rate of a hidden Markov process (HMP) defined by observing the output of a binary symmetric channel whose input is a first-order binary Markov process. Despit...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
In this paper, both non-mixing and mixing local minima of the entropy are analyzed from the viewpoint of blind source separation (BSS); they correspond respectively to acceptable a...
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
ICPR
2004
IEEE
15 years 10 months ago
2004
IEEE
We discuss the relationship between the discriminative training of Gaussian models and the maximum entropy framework for log-linear models. Observing that linear transforms leave ...
100
click to vote
ICMCS
2005
IEEE
15 years 3 months ago
2005
IEEE
Compression ratio and computational complexity are two major factors for a successful image coder. By exploring the Laplacian distribution of the wavelet coefficients, a new bit ...