160 search results - page 22 / 32 » A New Algorithm for Inexact Graph Matching |
99
Voted
ICPR
2000
IEEE
16 years 2 months ago
2000
IEEE
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
FSTTCS
2006
Springer
15 years 5 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
CSR
2009
Springer
15 years 8 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
128
click to vote
GBRPR
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Motion capture, a currently active research area, needs estimation of the pose of the subject. This requires a match between a model and the 3D shape, constructed using a...
122
Voted
DGCI
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...