Sciweavers

5138 search results - page 557 / 1028
» Randomized Algorithms for 3-SAT
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
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
16 years 7 months ago
One-dimensional quantum walks
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin V...
190
Voted
MOBIHOC
2006
ACM
16 years 6 months ago
Data storage placement in sensor networks
Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces stora...
Bo Sheng, Qun Li, Weizhen Mao
215
Voted
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