5153 search results - page 537 / 1031 » Introduction to Randomized Algorithms |
174
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
158
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
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)...
152
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
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...
192
click to vote
MOBIHOC
2006
ACM
16 years 6 months ago
2006
ACM
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...
216
click to vote
EWSN
2007
Springer
16 years 6 months ago
2007
Springer
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 ...