Sciweavers

2252 search results - page 390 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
AINTEC
2006
Springer
14 years 19 days ago
A Topology-Aware Overlay Multicast Approach for Mobile Ad-Hoc Networks
AOMP (Ad-hoc Overlay Multicast Protocol) is a novel approach for application-layer multicast in ad-hoc networks. We introduce in this paper a new algorithm that exploits a few prop...
Mohamed Ali Kâafar, Cyrine Mrabet, Thierry T...
PAMI
2011
13 years 3 months ago
Coded Strobing Photography: Compressive Sensing of High Speed Periodic Videos
—We show that, via temporal modulation, one can observe and capture a high-speed periodic video well beyond the abilities of a low-frame-rate camera. By strobing the exposure wit...
Ashok Veeraraghavan, Dikpal Reddy, Ramesh Raskar
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
14 years 3 months ago
Disproof of the Neighborhood Conjecture with Implications to SAT
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Heidi Gebauer
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
14 years 9 months ago
Spatial gossip and resource location protocols
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
David Kempe, Jon M. Kleinberg, Alan J. Demers
MOBICOM
2006
ACM
14 years 2 months ago
Stochastic event capture using mobile sensors subject to a quality metric
Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocit...
Nabhendra Bisnik, Alhussein A. Abouzeid, Volkan Is...