168 search results - page 14 / 34 » Lower Bounds for Distributed Coin-Flipping and Randomized Co... |
SODA
2008
ACM
15 years 1 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 ...
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
119
click to vote
SIAMCOMP
2011
14 years 6 months ago
2011
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
IPSN
2005
Springer
15 years 5 months ago
2005
Springer
We bound the number of sensors required to achieve a desired level of sensing accuracy in a discrete sensor network application (e.g. distributed detection). We model the state of...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Distributed source coding is traditionally viewed in the block coding context -- all the source symbols are known in advance at the encoders. This paper instead considers a stream...