Sciweavers

3130 search results - page 494 / 626
» Collusion without communication
Sort
View
PODC
2006
ACM
16 years 14 days ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
SENSYS
2006
ACM
16 years 14 days ago
Scalable data aggregation for dynamic events in sensor networks
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
Kai-Wei Fan, Sha Liu, Prasun Sinha
SENSYS
2006
ACM
16 years 14 days ago
Data compression algorithms for energy-constrained devices in delay tolerant networks
Sensor networks are fundamentally constrained by the difficulty and energy expense of delivering information from sensors to sink. Our work has focused on garnering additional si...
Christopher M. Sadler, Margaret Martonosi
SIGCOMM
2006
ACM
16 years 14 days ago
Drafting behind Akamai (travelocity-based detouring)
To enhance web browsing experiences, content distribution networks (CDNs) move web content “closer” to clients by caching copies of web objects on thousands of servers worldwi...
Ao-Jan Su, David R. Choffnes, Aleksandar Kuzmanovi...
SIGCOMM
2006
ACM
16 years 14 days ago
A measurement study on the impact of routing events on end-to-end internet path performance
Extensive measurement studies have shown that end-to-end Internet path performance degradation is correlated with routing dynamics. However, the root cause of the correlation betw...
Feng Wang, Zhuoqing Morley Mao, Jia Wang, Lixin Ga...