779 search results - page 10 / 156 » Algorithms for the Sample Mean of Graphs |
STOC
2005
ACM
15 years 10 months ago
2005
ACM
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
DICTA
2003
14 years 11 months ago
2003
The mean shift (MS) algorithm is sensitive to local peaks. In this paper, we show both empirically and analytically that when using sample data, the reconstructed PDF may have fals...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
RECOMB
2007
Springer
15 years 10 months ago
2007
Springer
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
118
click to vote
WWW
2011
ACM
14 years 4 months ago
2011
ACM
Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological...