Sciweavers

145 search results - page 2 / 29
» Bipartite Graph Matching for Computing the Edit Distance of ...
Sort
View
SIBGRAPI
2007
IEEE
13 years 11 months ago
Bipartite graph matching for video clip localization
Video clip localization consists in identifying real positions of a specific video clip in a video stream. To cope with this problem, we propose a new approach considering the ma...
Zenilton Kleber G. do Patrocínio Jr., Silvi...
GBRPR
2007
Springer
13 years 11 months ago
A Quadratic Programming Approach to the Graph Edit Distance Problem
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...
Michel Neuhaus, Horst Bunke
ICPR
2004
IEEE
14 years 6 months ago
A Probabilistic Approach to Learning Costs for Graph Edit Distance
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
Horst Bunke, Michel Neuhaus
ISCI
2007
170views more  ISCI 2007»
13 years 5 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
ICCV
2003
IEEE
13 years 10 months ago
Edit Distance From Graph Spectra
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the fo...
Antonio Robles-Kelly, Edwin R. Hancock