131 search results - page 25 / 27 » Adversary lower bounds for nonadaptive quantum algorithms |
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...
106
click to vote
GLOBECOM
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract—Wireless sensor networks (WSNs) are usually missioned to gather critical information in hostile and adversarial environments, which make them susceptible to compromise a...
DRM
2007
Springer
15 years 5 months ago
2007
Springer
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
110
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
SIAMCOMP
2002
14 years 11 months ago
2002
Abstract. In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This class...