9886 search results - page 264 / 1978 » Learning Compressible Models |
154
click to vote
ACL
2010
15 years 2 months ago
2010
This paper establishes a connection between two apparently very different kinds of probabilistic models. Latent Dirichlet Allocation (LDA) models are used as "topic models&qu...
121
click to vote
SAT
2004
Springer
15 years 9 months ago
2004
Springer
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...
ICPR
2010
IEEE
15 years 6 months ago
2010
IEEE
We present a methodology for learning spline-based probabilistic models for sets of contours, proposing a new Monte Carlo variant of the EM algorithm to estimate the parameters of...
138
click to vote
NIPS
2008
15 years 5 months ago
2008
Extensive labeled data for image annotation systems, which learn to assign class labels to image regions, is difficult to obtain. We explore a hybrid model framework for utilizing...
154
click to vote
ESANN
2006
15 years 5 months ago
2006
Due to the various and dynamic nature of stimuli, decisions of intelligent agents must rely on the coordination of complex cognitive systems. This paper precisely focusses on a gen...