10715 search results - page 74 / 2143 » From Tests to Proofs |
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
TCC
2010
Springer
14 years 4 months ago
2010
Springer
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...
SACMAT
2009
ACM
14 years 3 months ago
2009
ACM
A number of research systems have demonstrated the benefits of accompanying each request with a machine-checkable proof that the request complies with access-control policy — a...
AAAI
2000
13 years 10 months ago
2000
Developing tools that allow non-programmers to enter knowledge has been an ongoing challenge for AI. In recent years researchers have investigated a variety ofpromising approaches...
SYNTHESE
2008
2008
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
13 years 9 months ago
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...