3946 search results - page 470 / 790 » The computational complexity of choice sets |
171
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
175
click to vote
JOC
2008
15 years 6 months ago
2008
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
224
click to vote
IACR
2011
14 years 6 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
221
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Discriminative approaches to human pose inference involve mapping visual observations to articulated body configurations. Current probabilistic approaches to learn this mapping ha...
198
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...