3082 search results - page 386 / 617 » New Bounds for the Controller Problem |
183
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
177
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
202
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
166
click to vote
CCS
2003
ACM
15 years 12 months ago
2003
ACM
We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div...
187
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Throughput capacity in wireless ad hoc networks has been studied extensively under many different mobility models such as i.i.d. mobility model, Brownian mobility model, random ...