1018 search results - page 41 / 204 » Learning Probabilistic Models of Contours |
ICDAR
2009
IEEE
15 years 4 months ago
2009
IEEE
Hidden Markov Models (HMM) are probabilistic graphical models for interdependent classification. In this paper we experiment with different ways of combining the components of an ...
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
Low-rank matrix approximation methods provide one of the simplest and most effective approaches to collaborative filtering. Such models are usually fitted to data by finding a MAP...
CIVR
2007
Springer
15 years 4 months ago
2007
Springer
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
116
click to vote
IJCAI
2001
14 years 11 months ago
2001
Supervised and unsupervised learning methods have traditionally focused on data consisting of independent instances of a single type. However, many real-world domains are best des...
ICDM
2003
IEEE
15 years 3 months ago
2003
IEEE
We present a mixture model based approach for learning individualized behavior models for the Web users. We investigate the use of maximum entropy and Markov mixture models for ge...