2084 search results - page 322 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
165
click to vote
PVLDB
2010
14 years 4 months ago
2010
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
CONCUR
2010
Springer
14 years 11 months ago
2010
Springer
We are concerned with the availability of systems, defined as the ratio between time of correct functioning and uptime. We propose to model guaranteed availability in terms of regu...
PERCOM
2003
ACM
15 years 9 months ago
2003
ACM
Distributed systems require strategies to detect and recover from failures. Many protocols for distributed systems employ a strategy based on leases, which grant a leaseholder acc...
102
click to vote
QSHINE
2009
IEEE
15 years 4 months ago
2009
IEEE
Exploiting features of high density wireless sensor networks represents a challenging issue. In this work, the training of a sensor network which consists of anonymous and asynchro...