779 search results - page 7 / 156 » Algorithms for the Sample Mean of Graphs |
100
click to vote
FGR
2004
IEEE
15 years 1 months ago
2004
IEEE
Particle filter and mean shift are two successful approaches taken in the pursuit of robust tracking. Both of them have their respective strengths and weaknesses. In this paper, w...
WSDM
2009
ACM
15 years 4 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...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In this paper we further investigate the well-studied problem of finding a perfect matching in a regular bipartite graph. The first non-trivial algorithm, with running time O(mn),...
SIGCOMM
2010
ACM
14 years 10 months ago
2010
ACM
Microblogging services, such as Twitter, are among the most important online social networks(OSNs). Different from OSNs such as Facebook, the topology of microblogging service is ...
ISAAC
1998
Springer
15 years 1 months ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...