338 search results - page 8 / 68 » Fast distributed random walks |
TC
2008
14 years 9 months ago
2008
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
117
click to vote
TVCG
2011
14 years 4 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
69
Voted
DC
2000
14 years 9 months ago
2000
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
107
click to vote
SIGMETRICS
2012
ACM
13 years 16 hour ago
2012
ACM
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
91
Voted
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider the problem of multiclass classification where both labeled and unlabeled data points are given. We introduce and demonstrate a new approach for estimating a distribut...