2004 search results - page 164 / 401 » Sampling from large graphs |
125
click to vote
TPDS
2008
15 years 3 months ago
2008
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...
127
Voted
ASE
2004
15 years 3 months ago
2004
Abstract. The use of pointers presents serious problems for software productivity tools for software understanding, restructuring, and testing. Pointers enable indirect memory acce...
146
Voted
PAKDD
2011
ACM
14 years 6 months ago
2011
ACM
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
148
click to vote
CVPR
2012
IEEE
13 years 5 months ago
2012
IEEE
Grouping cues can affect the performance of segmentation greatly. In this paper, we show that superpixels (image segments) can provide powerful grouping cues to guide segmentation...
111
Voted
ICDM
2007
IEEE
15 years 9 months ago
2007
IEEE
ASALSAN is a new algorithm for computing three-way DEDICOM, which is a linear algebra model for analyzing intrinsically asymmetric relationships, such as trade among nations or th...