2695 search results - page 385 / 539 » Learning Graph Matching |
101
Voted
ICPR
2008
IEEE
16 years 4 months ago
2008
IEEE
We consider the problem of classification when multiple observations of a pattern are available, possibly under different transformations. We view this problem as a special case o...
122
Voted
MICCAI
2005
Springer
16 years 3 months ago
2005
Springer
Shape priors attempt to represent biological variations within a population. When variations are global, Principal Component Analysis (PCA) can be used to learn major modes of vari...
138
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
140
click to vote
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
153
Voted
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...