Sciweavers

7228 search results - page 401 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
CORR
2000
Springer
134views Education» more  CORR 2000»
15 years 6 months ago
Learning Complexity Dimensions for a Continuous-Time Control System
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
Pirkko Kuusela, Daniel Ocone, Eduardo D. Sontag
TIT
2008
61views more  TIT 2008»
15 years 6 months ago
A Probabilistic Upper Bound on Differential Entropy
A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution...
Erik G. Learned-Miller, Joseph DeStefano
ICASSP
2009
IEEE
16 years 1 months ago
Maximizing global entropy reduction for active learning in speech recognition
We propose a new active learning algorithm to address the problem of selecting a limited subset of utterances for transcribing from a large amount of unlabeled utterances so that ...
Balakrishnan Varadarajan, Dong Yu, Li Deng, Alex A...
ICASSP
2008
IEEE
16 years 1 months ago
Wavelet-domain compressive signal reconstruction using a Hidden Markov Tree model
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
Marco F. Duarte, Michael B. Wakin, Richard G. Bara...
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
16 years 7 months ago
A microeconomic data mining problem: customer-oriented catalog segmentation
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
Martin Ester, Rong Ge, Wen Jin, Zengjian Hu