2084 search results - page 339 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
177
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
272
click to vote
VLDB
2007
ACM
16 years 5 months ago
2007
ACM
Whenever an intrusion occurs, the security and value of a computer system is compromised. Network-based attacks make it difficult for legitimate users to access various network ser...
139
click to vote
EDCC
2005
Springer
15 years 10 months ago
2005
Springer
Unreliable failure detectors are a well known means to enrich asynchronous distributed systems with time-free semantics that allow to solve consensus in the presence of crash failu...
153
click to vote
ICALP
2004
Springer
15 years 10 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
147
click to vote
PDP
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same...