2695 search results - page 24 / 539 » Learning Graph Matching |
96
Voted
IWPEC
2009
Springer
15 years 8 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
119
click to vote
EJC
2010
15 years 1 months ago
2010
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
95
Voted
ACCV
1998
Springer
15 years 6 months ago
1998
Springer
We present an object recognition system based on symbolic graphs with object corners as vertices and outlines as edges. Corners are determined in a robust way by a multiscale combi...
130
click to vote
CVPR
2008
IEEE
16 years 3 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
209
click to vote
FGR
2011
IEEE
14 years 5 months ago
2011
IEEE
Abstract— We propose a novel hierarchical structured prediction approach for ranking images of faces based on attributes. We view ranking as a bipartite graph matching problem; l...