2312 search results - page 175 / 463 » The complexity of estimating min-entropy |
233
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
We present a general approach to model selection and regularization that exploits unlabeled data to adaptively control hypothesis complexity in supervised learning tasks. The idea ...
185
click to vote
ML
1998
ACM
15 years 6 months ago
1998
ACM
We introduce, analyze and demonstrate a recursive hierarchical generalization of the widely used hidden Markov models, which we name Hierarchical Hidden Markov Models (HHMM). Our m...
197
click to vote
PAMI
2007
15 years 6 months ago
2007
—A probabilistic formulation for semantic image annotation and retrieval is proposed. Annotation and retrieval are posed as classification problems where each class is defined as...
167
click to vote
PR
2007
15 years 6 months ago
2007
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
192
click to vote
RAS
2008
15 years 6 months ago
2008
The generation of trajectories for a biped robot is a problem which has been largely studied for several years, and many satisfying off-line solutions exist for steady-state walki...