Sciweavers

1568 search results - page 291 / 314
» The problem of examination questions in algorithmics
Sort
View
SIGCOMM
2009
ACM
15 years 10 months ago
DIRC: increasing indoor wireless capacity using directional antennas
The demand for wireless bandwidth in indoor environments such as homes and offices continues to increase rapidly. Although wireless technologies such as MIMO can reach link throug...
Xi Liu, Anmol Sheth, Michael Kaminsky, Konstantina...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 9 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
132
Voted
FOCS
2002
IEEE
15 years 8 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
15 years 7 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson
DAC
2004
ACM
15 years 7 months ago
Practical repeater insertion for low power: what repeater library do we need?
In this paper, we investigate the problem of repeater insertion for low power under a given timing budget. We propose a novel repeater insertion algorithm to compute the optimal r...
Xun Liu, Yuantao Peng, Marios C. Papaefthymiou