Sciweavers

3415 search results - page 641 / 683
» Lower Bounds for Kernelizations
Sort
View
FOCS
2009
IEEE
14 years 4 months ago
Choice-Memory Tradeoff in Allocations
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...
Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich
ICC
2009
IEEE
159views Communications» more  ICC 2009»
14 years 4 months ago
fP2P-HN: A P2P-Based Route Optimization Solution for Mobile IP and NEMO Clients
— Wireless technologies are rapidly evolving and the users are demanding the possibility of changing its point of attachment to the Internet (i.e. default router) without breakin...
Albert Cabellos-Aparicio, Rubén Cuevas Rum&...
INFOCOM
2009
IEEE
14 years 4 months ago
Scheduling in Mobile Ad Hoc Networks with Topology and Channel-State Uncertainty
—We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiu...
Lei Ying, Sanjay Shakkottai
INFOCOM
2009
IEEE
14 years 4 months ago
Duty-Cycle-Aware Broadcast in Wireless Sensor Networks
—Broadcast is one of the most fundamental services in wireless sensor networks (WSNs). It facilitates sensor nodes to propagate messages across the whole network, serving a wide ...
Feng Wang, Jiangchuan Liu
IPPS
2009
IEEE
14 years 4 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker