Sciweavers

1449 search results - page 58 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
96
Voted
FOCS
1992
IEEE
15 years 6 months ago
Efficient Inference of Partial Types
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...
Dexter Kozen, Jens Palsberg, Michael I. Schwartzba...
AAAI
2010
15 years 4 months ago
Integrating Sample-Based Planning and Model-Based Reinforcement Learning
Recent advancements in model-based reinforcement learning have shown that the dynamics of many structured domains (e.g. DBNs) can be learned with tractable sample complexity, desp...
Thomas J. Walsh, Sergiu Goschin, Michael L. Littma...
CISC
2009
Springer
148views Cryptology» more  CISC 2009»
15 years 11 days ago
A DAA Scheme Requiring Less TPM Resources
Abstract. Direct anonymous attestation (DAA) is a special digital signature primitive, which provides a balance between signer authentication and privacy. One of the most interesti...
Liqun Chen
STOC
2004
ACM
89views Algorithms» more  STOC 2004»
16 years 2 months ago
Hit-and-run from a corner
We show that the hit-and-run random walk mixes rapidly starting from any interior point of a convex body. This is the first random walk known to have this property. In contrast, t...
László Lovász, Santosh Vempal...
109
Voted
AAECC
1993
Springer
94views Algorithms» more  AAECC 1993»
15 years 6 months ago
Relations Among Lie Formal Series and Construction of Symplectic Integrators
Symplectic integrators are numerical integration schemes for hamiltonian systems. The integration step is an explicit symplectic map. We find symplectic integrators using universa...
Pierre-Vincent Koseleff