63 search results - page 1 / 13 » Strongly uniform bounds from semi-constructive proofs |
APAL
2006
14 years 9 months ago
2006
UAI
2003
14 years 11 months ago
2003
A fundamental question in causal inference is whether it is possible to reliably infer the manipulation effects from observational data. There are a variety of senses of asymptot...
62
Voted
TIT
2008
14 years 9 months ago
2008
We prove the strongest known bound for the risk of hypotheses selected from the ensemble generated by running a learning algorithm incrementally on the training data. Our result i...
101
click to vote
ASIACRYPT
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
115
click to vote
CHES
2011
Springer
13 years 9 months ago
2011
Springer
Randomness extractors are important tools in cryptography. Their goal is to compress a high-entropy source into a more uniform output. Beyond their theoretical interest, they have ...