1622 search results - page 54 / 325 » Learning a Hidden Matching |
126
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Restricted Boltzmann machines were developed using binary stochastic hidden units. These can be generalized by replacing each binary unit by an infinite number of copies that all ...
113
click to vote
MIR
2006
ACM
15 years 9 months ago
2006
ACM
We present a general approach for automatically matching electronic slides to videos of corresponding presentations for use in distance learning and video proceedings of conferenc...
123
click to vote
KDD
2007
ACM
16 years 3 months ago
2007
ACM
An essential part of an expert-finding task, such as matching reviewers to submitted papers, is the ability to model the expertise of a person based on documents. We evaluate seve...
126
Voted
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
Before the advent of Hidden Markov Models(HMM)-based speech recognition, many speech applications were built using pattern matching algorithms like the Dynamic Time Warping (DTW) ...
134
click to vote
ECML
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper we consider latent variable models and introduce a new U-likelihood concept for estimating the distribution over hidden variables. One can derive an estimat...