3484 search results - page 248 / 697 » Adversarial Web Search |
157
click to vote
ICIP
2000
IEEE
16 years 8 months ago
2000
IEEE
We present schemes for hardeningimage watermarks against adversarial jamming. Our techniques improve upon standard correlation- and spread spectrum-based methods, and withstand va...
152
click to vote
ICALP
2007
Springer
16 years 22 days ago
2007
Springer
We consider several private database query problems. The starting point of this work is the element rank problem: the server holds a database of n integers, and the user an integer...
151
click to vote
ESORICS
2005
Springer
16 years 3 days ago
2005
Springer
Distributed Hash Tables (DHTs) are very efficient distributed systems for routing, but at the same time vulnerable to disruptive nodes. Designers of such systems want them used in ...
188
click to vote
COCO
2004
Springer
15 years 12 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
169
click to vote
AAAI
2006
15 years 8 months ago
2006
While computers have defeated the best human players in many classic board games, progress in Go remains elusive. The large branching factor in the game makes traditional adversar...