2695 search results - page 86 / 539 » Learning Graph Matching |
118
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
121
click to vote
LEGE
2004
15 years 3 months ago
2004
A flexible approach for structuring and merging distributed learning object is presented. At the basis of this approach there is a formal representation of a learning object, call...
103
click to vote
ICCV
2003
IEEE
16 years 4 months ago
2003
IEEE
A Bayesian network formulation for relational shape matching is presented. The main advantage of the relational shape matching approach is the obviation of the non-rigid spatial m...
136
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
We present an object recognition system that locates an object, identifies its parts, and segments out its contours. A key distinction of our approach is that we use long, salien...
114
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...