449 search results - page 17 / 90 » Measuring the Similarity of Geometric Graphs |
ESA
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, we show that for an n-vertex graph G of genus g, the edge expansion of G can be determined in time nO(g2 ) . We show that the same is true for various other similar ...
RECOMB
1999
Springer
13 years 11 months ago
1999
Springer
We consider the problem of identifying common three-dimensional substructures between proteins. Our method is based on comparing the shape of the α-carbon backbone structures of ...
ICDM
2002
IEEE
14 years 14 days ago
2002
IEEE
Document clustering techniques mostly rely on single term analysis of the document data set, such as the Vector Space Model. To better capture the structure of documents, the unde...
ICCV
1998
IEEE
14 years 9 months ago
1998
IEEE
W e introduce a novel view-based object representation, called the saliency map graph (SMG), which captures the salient regions of an object view at multiple scales using a wavele...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper we propose two methods to derive two different kinds of node similarities in a network based on their neighborhood. The first similarity measure focuses on the overla...