2520 search results - page 23 / 504 » The complexity of approximating entropy |
ASIAMS
2007
IEEE
14 years 4 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
CSL
2010
Springer
13 years 9 months ago
2010
Springer
We propose a unified global entropy reduction maximization (GERM) framework for active learning and semi-supervised learning for speech recognition. Active learning aims to select...
NIPS
2008
13 years 11 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
ICIP
2005
IEEE
14 years 11 months ago
2005
IEEE
In this paper, we present a new entropy coder, Contextbased Bit Plane Golomb Coder (CB-BPGC) for scalable image coding, which achieves better coding performance with lower complex...
KCAP
2009
ACM
14 years 2 months ago
2009
ACM
Ontology modularization has received growing interest from the research community lately, since it supports tasks such as ontology design/reuse and knowledge selection and integra...