205 search results - page 18 / 41 » Pruning 2-Connected Graphs |
CVIU
2008
13 years 7 months ago
2008
The visual hull relates the shape of an object to its silhouettes. This paper develops the theory of the visual hull of piecewise smooth objects, as those used in CAD applications...
KDD
2004
ACM
14 years 7 months ago
2004
ACM
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
PVLDB
2010
13 years 5 months ago
2010
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...
SIGMOD
2010
ACM
13 years 5 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
WEA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...