302 search results - page 34 / 61 » Asymptotic performance of distributed detection over random ... |
SPAA
1997
ACM
13 years 11 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
CISS
2008
IEEE
14 years 1 months ago
2008
IEEE
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
PODC
2009
ACM
14 years 22 hour ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
INFOCOM
2000
IEEE
13 years 11 months ago
2000
IEEE
— End-to-end congestion control mechanisms such as those in TCP are not enough to prevent congestion collapse in the Internet (for starters, not all applications might be willing...