742 search results - page 79 / 149 » Visualizing Graphs - A Generalized View |
162
click to vote
WSDM
2009
ACM
16 years 1 months ago
2009
ACM
In this paper, we attempt to improve the effectiveness and the efficiency of query-dependent link-based ranking algorithms such as HITS, MAX and SALSA. All these ranking algorith...
259
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
160
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
190
click to vote
ICIP
1998
IEEE
15 years 10 months ago
1998
IEEE
1 In this paper, the segmentation problem is formulated as a problem of segmenting a Riemannian manifold. The image domain is endowed with an anisotropic metric and its segmentatio...
140
click to vote
SAC
2008
ACM
15 years 5 months ago
2008
ACM
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...