Sciweavers

478 search results - page 4 / 96
» Measuring the Similarity of Labeled Graphs
Sort
View
ISCI
2007
170views more  ISCI 2007»
13 years 6 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
MM
2006
ACM
148views Multimedia» more  MM 2006»
14 years 19 days ago
Audio similarity measure by graph modeling and matching
This paper proposes a new approach for the similarity measure and ranking of audio clips by graph modeling and matching. Instead of using frame-based or salient-based features to ...
Yuxin Peng, Chong-Wah Ngo, Cuihua Fang, Xiaoou Che...
ICPR
2004
IEEE
14 years 7 months ago
A Graph-Based Approach to Corner Matching Using Mutual Information as a Local Similarity Measure
Corner matching constitutes a fundamental vision problem that serves as a building block of several important applications. The common approach to dealing with this problem starts...
Manolis I. A. Lourakis, Antonis A. Argyros, Kostas...
CORR
2004
Springer
121views Education» more  CORR 2004»
13 years 6 months ago
A measure of similarity between graph vertices
We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with, respectively, nA and nB vertices. We define an nB
Vincent D. Blondel, Anahí Gajardo, Maureen ...
JAL
2006
100views more  JAL 2006»
13 years 6 months ago
Distance and routing labeling schemes for non-positively curved plane graphs
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices u and v can be determined effic...
Victor Chepoi, Feodor F. Dragan, Yann Vaxès