1018 search results - page 86 / 204 » Learning Probabilistic Models of Contours |
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
This paper introduces two new methods for label ranking based on a probabilistic model of ranking data, called the Plackett-Luce model. The idea of the first method is to use the ...
NLPRS
2001
Springer
15 years 2 months ago
2001
Springer
We describe a new tagging model where the states of a hidden Markov model (HMM) estimated by unsupervised learning are incorporated as the features in a maximum entropy model. Our...
ECML
2006
Springer
15 years 1 months ago
2006
Springer
The standard approach for learning Markov Models with Hidden State uses the Expectation-Maximization framework. While this approach had a significant impact on several practical ap...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
A plausible definition of "reasoning" could be "algebraically manipulating previously acquired knowledge in order to answer a new question". This definition co...
103
click to vote
ECCV
2008
Springer
15 years 12 months ago
2008
Springer
Probabilistic graphical models such as Bayesian Networks have been increasingly applied to many computer vision problems. Accuracy of inferences in such models depends on the quali...