165 search results - page 29 / 33 » Cryptographic Complexity Classes and Computational Intractab... |
110
click to vote
CCS
2008
ACM
15 years 1 months ago
2008
ACM
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
140
click to vote
STOC
2000
ACM
15 years 4 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
102
click to vote
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
95
Voted
CONCUR
2009
Springer
15 years 6 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
Many perception and multimedia indexing problems involve datasets that are naturally comprised of multiple streams or modalities for which supervised training data is only sparsely...