3 search results - page 1 / 1 » Matching Free Trees, Maximal Cliques, and Monotone Game Dyna... |
EMMCVPR
2001
Springer
13 years 9 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
NIPS
2001
13 years 6 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
ICPR
2000
IEEE
14 years 5 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...