Sciweavers

59 search results - page 12 / 12
» gil 2010
Sort
View
INFOCOM
2010
IEEE
13 years 3 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
SIGMETRICS
2010
ACM
173views Hardware» more  SIGMETRICS 2010»
13 years 10 months ago
Channel fragmentation in dynamic spectrum access systems: a theoretical study
Dynamic Spectrum Access systems exploit temporarily available spectrum (‘white spaces’) and can spread transmissions over a number of non-contiguous sub-channels. Such methods...
Edward G. Coffman Jr., Philippe Robert, Florian Si...
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
13 years 6 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
SECON
2010
IEEE
13 years 3 months ago
Prototyping Energy Harvesting Active Networked Tags (EnHANTs) with MICA2 Motes
Abstract--With the convergence of ultra-low-power communications and energy-harvesting technologies, networking selfsustainable ubiquitous devices is becoming feasible. Hence, we h...
Maria Gorlatova, T. Sharma, D. Shrestha, E. Xu, Ji...