Sciweavers

5966 search results - page 1060 / 1194
» Distributed Caching Algorithms for Content Distribution Netw...
Sort
View
SPAA
2004
ACM
15 years 12 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
SIGCOMM
2010
ACM
15 years 6 months ago
NapSAC: design and implementation of a power-proportional web cluster
Energy consumption is a major and costly problem in data centers. A large fraction of this energy goes to powering idle machines that are not doing any useful work. We identify tw...
Andrew Krioukov, Prashanth Mohan, Sara Alspaugh, L...
MOBICOM
2012
ACM
13 years 9 months ago
MARVEL: multiple antenna based relative vehicle localizer
Access to relative location of nearby vehicles on the local roads or on the freeways is useful for providing critical alerts to the drivers, thereby enhancing their driving experi...
Dong Li, Tarun Bansal, Zhixue Lu, Prasun Sinha
MOBISYS
2008
ACM
16 years 6 months ago
Efficient channel-aware rate adaptation in dynamic environments
Increasingly, 802.11 devices are being used by mobile users. This results in very dynamic wireless channels that are difficult to use efficiently. Current rate selection algorithm...
Glenn Judd, Xiaohui Wang, Peter Steenkiste
MOBICOM
2012
ACM
13 years 9 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
« Prev « First page 1060 / 1194 Last » Next »