4137 search results - page 92 / 828 » On the number of matchings of a tree |
IJFCS
2007
15 years 1 months ago
2007
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree auto...
135
click to vote
CVPR
2005
IEEE
16 years 4 months ago
2005
IEEE
This paper considers the objectives of accurate stereo matching, especially at object boundaries, robustness against recording or illumination changes and efficiency of the calcul...
120
click to vote
SMI
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper, we describe a novel method for searching and comparing 3D objects. The method encodes the geometric and topological information in the form of a skeletal graph and ...
141
click to vote
CCCG
2008
15 years 3 months ago
2008
Curve matching is an important computational task for domains such as: reconstruction of archaeological fragments, forensics investigation, measuring melodic similarity, and model...
141
click to vote
ISAAC
2009
Springer
15 years 8 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...