1818 search results - page 182 / 364 » Granularity-Adaptive Proof Presentation |
143
Voted
CRYPTO
2009
Springer
15 years 10 months ago
2009
Springer
Most of the work in the analysis of cryptographic schemes is concentrated in abstract adversarial models that do not capture side-channel attacks. Such attacks exploit various for...
63
Voted
DAC
2005
ACM
16 years 4 months ago
2005
ACM
We present several improvements to general-purpose sequential redundancy removal. First, we propose using a robust variety of synergistic transformation and verification algorithm...
127
click to vote
ICML
1995
IEEE
16 years 4 months ago
1995
IEEE
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
234
Voted
POPL
2007
ACM
16 years 3 months ago
2007
ACM
We present an internal language with equivalent expressive power to Standard ML, and discuss its formalization in LF and the machine-checked verification of its type safety in Twe...
136
click to vote
CADE
2008
Springer
16 years 3 months ago
2008
Springer
We present a novel proof of Toyama's famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in th...