Marcello Pelillo  Home/Search
Context
Related
| cmu.edu/Groups/NIPS/NIPS20...AA17.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/Groups/NIPS/NIPS2001/p... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 graph whose maximal cliques are in one-to-one correspondence with maximal common subtrees. We then solve the problem using simple replicator dynamics from evolutionary game theory. Experiments on hundreds of uniformly random trees are presented. The results are impressive: despite the inherent inability of... (Update)
Similar documents (at the sentence level): More
35.5%: Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics - Pelillo (2002) (Correct)
19.8%: Matching Hierarchical Structures Using Association Graphs - Pelillo, Siddiqi, Zucker (1998) (Correct)
11.5%: Continuous-based Heuristics for Graph and Tree.. - Pelillo, Siddiqi, Zucker (1999) (Correct)
Active bibliography (related documents): More All
0.2: Annealed Imitation: Fast Dynamics for Maximum Clique - Marcello Pelillo Dipartimento (Correct)
0.2: Heuristics For Maximum Clique And Independent Set - Pelillo (1999) (Correct)
0.1: Replicator Dynamics in Combinatorial Optimization - Pelillo (Correct)
Similar documents based on text: More All
0.8: Replicator Equations, Maximal Cliques, and Graph Isomorphism - Pelillo (1998) (Correct)
0.6: A Replicator Equations-Based Evolutionary Algorithm for the.. - Rossi (2000) (Correct)
0.6: Approximating the Maximum Weight Clique Using Replicator.. - Bomze, Pelillo, Stix (1999) (Correct)
BibTeX entry: (Update)
@misc{ pelillo-matching,
author = "Marcello Pelillo",
title = "Matching Free Trees with Replicator Equations",
url = "citeseer.ist.psu.edu/540988.html" }
Citations (may not include all citations):539 Computer Vision (context) - Ballard, Brown - 1982
86 Shape description using weighted symmetric axis features (context) - Blum, Nagel - 1978
39 The maximum clique problem - Bomze, Budinich et al. - 1999
19 Evolution towards the maximum clique (context) - Bomze - 1997
7 Approximating the maximum weight clique using replicator dyn.. - Bomze, Pelillo et al. - 2000
Documents on the same site (http://www-2.cs.cmu.edu/Groups/NIPS/NIPS2001/papers/): More
Computing Time Lower Bounds for Recurrent Sigmoidal Neural Networks - Schmitt (2001) (Correct)
Effective Size of Receptive Fields of Inferior.. - Trappenberg, Rolls.. (2001) (Correct)
Learning a Gaussian Process Prior for.. - Platt, Burges.. (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC