Sciweavers

534 search results - page 5 / 107
» One more bit is enough
Sort
View
ICC
2007
IEEE
103views Communications» more  ICC 2007»
14 years 1 months ago
A More Realistic Approach to Information-Theoretic Sum Capacity of Reverse Link CDMA Systems in a Single Cell
— In this paper, we discuss the information–theoretic approach to finding the pattern of transmission powers of the stations in a CDMA system which maximizes the aggregate cap...
Arash Abadpour, Attahiru Sule Alfa, Anthony C. K. ...
COLT
2008
Springer
13 years 8 months ago
More Efficient Internal-Regret-Minimizing Algorithms
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
Amy R. Greenwald, Zheng Li, Warren Schudy
EUROPAR
2005
Springer
14 years 17 days ago
Event-Based Measurement and Analysis of One-Sided Communication
Abstract. To analyze the correctness and the performance of a program, information about the dynamic behavior of all participating processes is needed. The dynamic behavior can be ...
Marc-André Hermanns, Bernd Mohr, Felix Wolf
IJNSEC
2006
61views more  IJNSEC 2006»
13 years 7 months ago
Is There a Shortage of Primes for Cryptography?
Cryptographic algorithms often prescribe the use of primes whose length in bits is a power of 2. Recently, we proved that for m > 1, there is no prime number with 2m significan...
Samuel S. Wagstaff Jr.
INFOCOM
2010
IEEE
13 years 5 months ago
Exploiting Multiple-Antenna Diversity for Shared Secret Key Generation in Wireless Networks
—Generating a secret key between two parties by extracting the shared randomness in the wireless fading channel is an emerging area of research. Previous works focus mainly on si...
Kai Zeng, Daniel Wu, An Chan, Prasant Mohapatra