73 search results - page 12 / 15 » Substructure Similarity Search in Graph Databases |
WWW
2010
ACM
14 years 3 months ago
2010
ACM
We consider the problem of deep web source selection and argue that existing source selection methods are inadequate as they are based on local similarity assessment. Specificall...
CIVR
2007
Springer
14 years 2 months ago
2007
Springer
In the present study, an efficient strategy for retrieving texture images from large texture databases is introduced and studied within a distributional-statistical framework. Our...
KDD
2009
ACM
14 years 9 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
CVPR
2004
IEEE
14 years 10 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
BMCBI
2006
13 years 8 months ago
2006
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...