827 search results - page 82 / 166 » The Complexity of Probabilistic Lobbying |
146
click to vote
VTS
2007
IEEE
16 years 18 days ago
2007
IEEE
Attack resistance has been a critical concern for security-related applications. Various side-channel attacks can be launched to retrieve security information such as encryption k...
186
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
159
click to vote
AIME
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we investigate the role of a biomedical dataset on the classification accuracy of an algorithm. We quantify the complexity of a biomedical dataset using five complex...
125
click to vote
NIPS
2008
15 years 7 months ago
2008
This paper describes a recursive estimation procedure for multivariate binary densities using orthogonal expansions. For d covariates, there are 2d basis coefficients to estimate,...
161
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...