Sciweavers

909 search results - page 1 / 182
» Performance Evaluation of the VF Graph Matching Algorithm
Sort
View
ICIAP
1999
ACM
13 years 8 months ago
Performance Evaluation of the VF Graph Matching Algorithm
Luigi P. Cordella, Pasquale Foggia, Carlo Sansone,...
JGAA
2007
135views more  JGAA 2007»
13 years 4 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
PRL
2011
12 years 7 months ago
Structural matching of 2D electrophoresis gels using deformed graphs
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
Alexandre Noma, Alvaro Pardo, Roberto Marcondes Ce...
CEC
2007
IEEE
13 years 11 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
OTM
2010
Springer
13 years 2 months ago
Towards Evaluating GRASIM for Ontology-Based Data Matching
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
Yan Tang