74 search results - page 13 / 15 » Random Debaters and the Hardness of Approximating Stochastic... |
COCO
2001
Springer
15 years 2 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
ML
2006
ACM
14 years 9 months ago
2006
ACM
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
STOC
2006
ACM
15 years 9 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
SSWMC
2004
14 years 10 months ago
2004
We study a detection-theoretic approach to steganalysis. The relative entropy between covertext and stegotext determines the steganalyzer's difficulty in discriminating them,...
DAC
2007
ACM
15 years 10 months ago
2007
ACM
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...