Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ISCI
2007
170views more  ISCI 2007»
11 years 1 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
PAMI
2006
164views more  PAMI 2006»
11 years 1 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
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. ...
Derek Justice, Alfred O. Hero
FPGA
2008
ACM
174views FPGA» more  FPGA 2008»
11 years 3 months ago
Pattern-based behavior synthesis for FPGA resource reduction
Pattern-based synthesis has drawn wide interest from researchers who tried to utilize the regularity in applications for design optimizations. In this paper we present a general p...
Jason Cong, Wei Jiang
ICCV
2003
IEEE
11 years 6 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
GBRPR
2007
Springer
11 years 7 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke
ICPR
2004
IEEE
12 years 2 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
ICPR
2006
IEEE
12 years 2 months ago
A Convolution Edit Kernel for Error-tolerant Graph Matching
General graph matching methods often suffer from the lack of mathematical structure in the space of graphs. Using kernel functions to evaluate structural graph similarity allows u...
Horst Bunke, Michel Neuhaus
ICIP
2007
IEEE
12 years 3 months ago
A Case-Based Reasoning Approach for Unknown Class Invoice Processing
This paper introduces an invoice analysis approach using CaseBased Reasoning (CBR). CBR is used to analyze and interpret new invoices thanks to the previous processing experiences...
Abdel Belaïd, Hatem Hamza, Yolande Belaï...
books