Sciweavers

1170 search results - page 103 / 234
» How Fast Is Too Fast
Sort
View
ICFP
1997
ACM
15 years 7 months ago
Implementing Bit-addressing with Specialization
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
Scott Draves
110
Voted
ARCS
2006
Springer
15 years 7 months ago
Minimising the Hardware Resources for a Cellular Automaton with Moving Creatures
: Given is the following "creature's exploration problem": n creatures are moving around in an unknown environment in order to visit all cells in shortest time. This...
Mathias Halbach, Rolf Hoffmann
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
15 years 6 months ago
Efficient Generation of Prime Numbers
The generation of prime numbers underlies the use of most public-key schemes, essentially as a major primitive needed for the creation of key pairs or as a computation stage appear...
Marc Joye, Pascal Paillier, Serge Vaudenay
FAST
2010
15 years 5 months ago
A Clean-Slate Look at Disk Scrubbing
A number of techniques have been proposed to reduce the risk of data loss in hard-drives, from redundant disks (e.g., RAID systems) to error coding within individual drives. Disk ...
Alina Oprea, Ari Juels
FAST
2008
15 years 5 months ago
Parity Lost and Parity Regained
RAID storage systems protect data from storage errors, such as data corruption, using a set of one or more integrity techniques, such as checksums. The exact protection offered by...
Andrew Krioukov, Lakshmi N. Bairavasundaram, Garth...