793 search results - page 58 / 159 » Argumentation and standards of proof |
100
Voted
ICALP
2003
Springer
15 years 6 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
107
click to vote
DATAMINE
1998
15 years 13 days ago
1998
The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and non-...
168
Voted
AGI
2011
14 years 4 months ago
2011
Abstract. Recent theories of universal algorithmic intelligence, combined with the view that the world can be completely specified in mathematical terms, have led to claims about ...
134
Voted
CRYPTO
2011
Springer
14 years 17 days ago
2011
Springer
In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allow...
115
Voted
EUROCRYPT
2011
Springer
14 years 4 months ago
2011
Springer
In this work, we present HIBE and ABE schemes which are “unbounded” in the sense that the public parameters do not impose additional limitations on the functionality of the sy...