14 search results - page 2 / 3 » SAPPER: Subgraph Indexing and Approximate Matching in Large ... |
130
click to vote
SIGMOD
2005
ACM
15 years 5 months ago
2005
ACM
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for...
112
click to vote
SIGMOD
2011
ACM
14 years 2 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
104
click to vote
KDD
2007
ACM
15 years 12 months ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
ICDM
2008
IEEE
15 years 6 months ago
2008
IEEE
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
ECCV
2002
Springer
16 years 1 months ago
2002
Springer
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...