Sciweavers

1628 search results - page 76 / 326
» Compiler Construction Using Scheme
Sort
View
SCN
2010
Springer
176views Communications» more  SCN 2010»
14 years 10 months ago
The Fiat-Shamir Transform for Group and Ring Signature Schemes
The Fiat-Shamir (FS) transform is a popular tool to produce particularly efficient digital signature schemes out of identification protocols. It is known that the resulting signat...
Ming-Feng Lee, Nigel P. Smart, Bogdan Warinschi
ICECCS
1995
IEEE
108views Hardware» more  ICECCS 1995»
15 years 3 months ago
Using speculative execution for fault tolerance in a real-time system
Achieving fault-tolerance using a primary-backup approach involves overhead of recovery such as activating the backup and propagating execution states, which may a ect the timelin...
Mohamed F. Younis, Grace Tsai, Thomas J. Marlowe, ...
NIPS
1998
15 years 1 months ago
Scheduling Straight-Line Code Using Reinforcement Learning and Rollouts
The execution order of a block of computer instructions can make a difference in its running time by a factor of two or more. In order to achieve the best possible speed, compiler...
Amy McGovern, J. Eliot B. Moss
COLING
2000
15 years 1 months ago
The Use of Instrumentation in Grammar Engineering
This paper explores the usefltllmss of a technique from software engineering, (:ode instrumentation, tbr the developlnent of large-scale natural language grammars, hltbrlnation ab...
Norbert Bröker
ASIACRYPT
2007
Springer
15 years 6 months ago
Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
Unbalanced Feistel schemes with expanding functions are used to construct pseudo-random permutations from kn bits to kn bits by using random functions from n bits to (k − 1)n bit...
Jacques Patarin, Valérie Nachef, Côme...