1327 search results - page 75 / 266 » Path following algorithm for the graph matching problem |
131
Voted
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
102
click to vote
ICNP
2005
IEEE
15 years 7 months ago
2005
IEEE
Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles tha...
101
click to vote
ICCV
2007
IEEE
16 years 3 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
102
Voted
VISSYM
2007
15 years 4 months ago
2007
For displaying a dense graph, an adjacency matrix is superior than a node-link diagram because it is more compact and free of visual clutter. A node-link diagram, however, is far ...
115
click to vote
TKDE
2008
15 years 1 months ago
2008
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...