2031 search results - page 64 / 407 » On Tree-Constrained Matchings and Generalizations |
101
click to vote
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
We propose a graph-based semi-supervised symmetric matching framework that performs dense matching between two uncalibrated wide-baseline images by exploiting the results of sparse...
AICCSA
2007
IEEE
15 years 4 months ago
2007
IEEE
Several matching algorithms were recently developed in order to automate or semi-automate the process of correspondences discovery between XML schemas. These algorithms use a wide...
127
click to vote
ICCV
2005
IEEE
15 years 3 months ago
2005
IEEE
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...
ESA
2004
Springer
15 years 3 months ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
JCT
2007
14 years 9 months ago
2007
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...