Sciweavers

1056 search results - page 80 / 212
» Constraint-Based Graph Matching
Sort
View
JCDL
2004
ACM
94views Education» more  JCDL 2004»
14 years 2 months ago
Element matching in concept maps
Concept maps (CM) are informal, semantic, node-link conceptual graphs used to represent knowledge in a variety of applications. Algorithms that compare concept maps would be usefu...
Byron Marshall, Therani Madhusudan
NIPS
2007
13 years 10 months ago
Linear programming analysis of loopy belief propagation for weighted matching
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we investiga...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
DSS
2006
116views more  DSS 2006»
13 years 9 months ago
Matching knowledge elements in concept maps using a similarity flooding algorithm
Concept mapping systems used in education and knowledge management emphasize flexibility of representation to enhance learning and facilitate knowledge capture. Collections of con...
Byron Marshall, Hsinchun Chen, Therani Madhusudan
EMMCVPR
2001
Springer
14 years 1 months ago
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics
—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...
Marcello Pelillo
DAM
2002
135views more  DAM 2002»
13 years 9 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera