Sciweavers

78 search results - page 5 / 16
» Graph Matching Based on Node Signatures
Sort
View
GRAPHICSINTERFACE
2009
13 years 5 months ago
Structural differences between two graphs through hierarchies
This paper presents a technique for visualizing the differences between two graphs. The technique assumes that a unique labeling of the nodes for each graph is available, where if...
Daniel Archambault
ECAI
2008
Springer
13 years 9 months ago
Approximate structure preserving semantic matching
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...
CVPR
2007
IEEE
14 years 9 months ago
An MRF and Gaussian Curvature Based Shape Representation for Shape Matching
Matching and registration of shapes is a key issue in Computer Vision, Pattern Recognition, and Medical Image Analysis. This paper presents a shape representation framework based ...
Pengdong Xiao, Nick Barnes, Tibério S. Caet...
VLDB
2005
ACM
144views Database» more  VLDB 2005»
14 years 1 months ago
Bidirectional Expansion For Keyword Search on Graph Databases
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
Varun Kacholia, Shashank Pandit, Soumen Chakrabart...
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
14 years 7 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...