Sciweavers

221 search results - page 12 / 45
» Graph matching with type constraints on nodes and edges
Sort
View
SIGMOD
2004
ACM
165views Database» more  SIGMOD 2004»
14 years 7 months ago
Industrial-Strength Schema Matching
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
Philip A. Bernstein, Sergey Melnik, Michalis Petro...
CSCLP
2007
Springer
14 years 1 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...
PKDD
2010
Springer
152views Data Mining» more  PKDD 2010»
13 years 6 months ago
CET: A Tool for Creative Exploration of Graphs
We present a tool for interactive exploration of graphs that integrates advanced graph mining methods in an interactive visualization framework. The tool enables efficient explorat...
Stefan Haun, Andreas Nürnberger, Tobias K&oum...
WSR
2008
13 years 9 months ago
Graph Technology in Reverse Engineering: The TGraph Approach
: TGraphs are directed graphs with typed, attributed, and ordered nodes and edges. These properties leverage the use of graphs as models for all kinds of artifacts in the context o...
Jürgen Ebert, Volker Riediger, Andreas Winter
MLG
2007
Springer
14 years 1 months ago
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
Alex J. Smola