909 search results - page 86 / 182 » Games for extracting randomness |
147
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we address the problem of selfish behavior in ad hoc networks. We propose a strategy driven approach which aims at enforcing cooperation between network participant...
144
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
149
click to vote
TSD
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This paper suggests a novel representation for documents that is intended to improve precision. This representation is generated by combining two central techniques: Rand...
129
click to vote
CISS
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract—This paper presents a novel zero-sum watermarking game between a detection algorithm and a data hiding adversary. Contrary to previous research, the detection algorithm ...
109
click to vote
ESA
2003
Springer
15 years 10 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...