41 search results - page 1 / 9 » A Quadratic Programming Approach to the Graph Edit Distance ... |
GBRPR
2007
Springer
14 years 5 months ago
2007
Springer
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...
PKDD
2010
Springer
13 years 8 months ago
2010
Springer
As an alternative to vector representations, a recent trend in image classification suggests to integrate additional structural information in the description of images in order to...
PAMI
2006
13 years 10 months ago
2006
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
SIAMJO
2010
13 years 5 months ago
2010
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
CORR
2010
Springer
13 years 11 months ago
2010
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...