41 search results - page 2 / 9 » A Quadratic Programming Approach to the Graph Edit Distance ... |
156
Voted
ICMCS
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper proposes employing a graph-theoretic approach to estimate the region correspondence between two images. We represent each image as an attributed undirected graph and tr...
153
click to vote
STACS
2009
Springer
16 years 14 hour ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
148
Voted
ICIAP
1999
ACM
15 years 9 months ago
1999
ACM
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
203
click to vote
DISOPT
2011
14 years 8 months ago
2011
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
168
Voted
NIPS
2003
15 years 6 months ago
2003
This paper presents a method for learning a distance metric from relative comparison such as “A is closer to B than A is to C”. Taking a Support Vector Machine (SVM) approach,...