Sciweavers

2924 search results - page 353 / 585
» Lower Bounds in Distributed Computing
Sort
View
IPCCC
2007
IEEE
15 years 11 months ago
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
My T. Thai, Yingshu Li, Feng Wang 0002
VTC
2007
IEEE
15 years 11 months ago
Opportunistic Feedback Protocol for Achieving Sum-Capacity of the MIMO Broadcast Channel
—This paper presents an opportunistic feedback (OF) protocol that achieves the asymptotic sum-capacity of the fading broadcast channel (BC) with a limited amount of feedback. The...
Rajiv Agarwal, Chan-Soo Hwang, John M. Cioffi
APPROX
2007
Springer
92views Algorithms» more  APPROX 2007»
15 years 11 months ago
Sublinear Algorithms for Approximating String Compressibility
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, A...
CRYPTO
2007
Springer
109views Cryptology» more  CRYPTO 2007»
15 years 11 months ago
A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quant...
Ivan Damgård, Serge Fehr, Renato Renner, Lou...
MSN
2007
Springer
110views Sensor Networks» more  MSN 2007»
15 years 10 months ago
A Location Aided Flooding Protocol for Wireless Ad Hoc Networks
Flooding in wireless ad hoc networks is a fundamental and critical operation in supporting various applications and protocols. However, the traditional flooding scheme generates ex...
Xinxin Liu, Xiaohua Jia, Hai Liu, Li Feng