6 search results - page 1 / 2 » Replicator Equations, Maximal Cliques, and Graph Isomorphism |
NIPS
1998
13 years 6 months ago
1998
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...
ECCV
1998
Springer
14 years 7 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
ICPR
2000
IEEE
14 years 6 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...
LION
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...