Sciweavers

152 search results - page 7 / 31
» Constructive Proofs of Concentration Bounds
Sort
View
JMLR
2008
129views more  JMLR 2008»
13 years 7 months ago
Finite-Time Bounds for Fitted Value Iteration
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
Rémi Munos, Csaba Szepesvári
CCS
2007
ACM
14 years 1 months ago
Pors: proofs of retrievability for large files
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier...
Ari Juels, Burton S. Kaliski Jr.
MFCS
1989
Springer
13 years 11 months ago
Space Bounded Computations: Review And New Separation Results
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...
Juris Hartmanis, Desh Ranjan
IEICET
2011
13 years 2 months ago
The Security of Abreast-DM in the Ideal Cipher Model
Abstract. In this paper, we give a security proof for Abreast-DM in terms of collision resistance and preimage resistance. As old as Tandem-DM, the compression function Abreast-DM ...
Jooyoung Lee, Daesung Kwon
FSTTCS
2005
Springer
14 years 1 months ago
Quantitative Models and Implicit Complexity
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
Ugo Dal Lago, Martin Hofmann