111 search results - page 21 / 23 » The Complexity of Local List Decoding |
MOBIHOC
2004
ACM
14 years 5 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
SOSP
2005
ACM
14 years 2 months ago
2005
ACM
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
SPAA
2009
ACM
14 years 17 days ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
C3S2E
2009
ACM
14 years 9 days ago
2009
ACM
This article introduces Nohalo level 1 (“Nohalo”), the simplest member of a family of image resamplers which straighten diagonal interfaces without adding noticeable nonlinear...
SIGCOMM
2009
ACM
14 years 9 days ago
2009
ACM
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...