Sciweavers

7228 search results - page 472 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
16 years 7 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai
EWSN
2007
Springer
16 years 6 months ago
Decentralized Scattering of Wake-Up Times in Wireless Sensor Networks
Duty-cycling in wireless sensor networks (WSNs) has both beneficial effects on network lifetime and negative effects on application performance due to the inability of a sensor to ...
Alessandro Giusti, Amy L. Murphy, Gian Pietro Picc...
DCC
2007
IEEE
16 years 6 months ago
On binary signed digit representations of integers
Applications of signed digit representations of an integer include computer arithmetic, cryptography, and digital signal processing. An integer of length n bits can have several b...
Nevine Maurice Ebeid, M. Anwar Hasan
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
16 years 4 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG
SODA
2010
ACM
208views Algorithms» more  SODA 2010»
16 years 4 months ago
Correlation Robust Stochastic Optimization
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
Shipra Agrawal, Yichuan Ding, Amin Saberi, Yinyu Y...