619 search results - page 9 / 124 » A dynamical systems approach to weighted graph matching |
107
click to vote
EMMCVPR
2001
Springer
15 years 6 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...
113
click to vote
ICPR
2010
IEEE
15 years 5 months ago
2010
IEEE
We present a fast and robust graph matching approach for 2D specific object recognition in images. From a small number of training images, a model graph of the object to learn is a...
107
click to vote
ICWS
2007
IEEE
15 years 2 months ago
2007
IEEE
The ability to dynamically discover and invoke a Web Service is a critical aspect of Service Oriented Architectures. An important component of the discovery process is the matchma...
145
click to vote
IPMI
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. Brain matching is an important problem in neuroimaging studies. Current surface-based methods for cortex matching and atlasing, although quite accurate, can require long ...
107
click to vote
CGF
2008
15 years 1 months ago
2008
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...