302 search results - page 30 / 61 » Asymptotic performance of distributed detection over random ... |
P2P
2010
IEEE
13 years 5 months ago
2010
IEEE
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
PODC
2005
ACM
14 years 28 days ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
SPAA
2005
ACM
14 years 28 days ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
We propose a Polynomial-based scheme that addresses the problem of Event Region Detection (PERD) for wireless sensor networks (WSNs). Nodes of an aggregation tree perform function ...
JSAC
2008
13 years 7 months ago
2008
In this paper, we generalize the random access game model, and show that it provides a general game-theoretic framework for designing contention based medium access control. We ext...