Sciweavers

590 search results - page 8 / 118
» Resolution-stationary random number generators
Sort
View
MOC
2000
132views more  MOC 2000»
14 years 9 months ago
Lattice computations for random numbers
We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to ...
Raymond Couture, Pierre L'Ecuyer
FSE
2007
Springer
263views Cryptology» more  FSE 2007»
15 years 3 months ago
Bad and Good Ways of Post-processing Biased Physical Random Numbers
Algorithmic post-processing is used to overcome statistical deficiencies of physical random number generators. We show that the quasigroup based approach for post-processing rando...
Markus Dichtl
EGH
2010
Springer
14 years 7 months ago
GPU random numbers via the tiny encryption algorithm
Random numbers are extensively used on the GPU. As more computation is ported to the GPU, it can no longer be treated as rendering hardware alone. Random number generators (RNG) a...
Fahad Zafar, Marc Olano, Aaron Curtis
ICCS
2005
Springer
15 years 3 months ago
Numerically Stable Real Number Codes Based on Random Matrices
Abstract — Error correction codes defined over realnumber and complex-number fields have been studied and recognized as useful in many applications. However, most real-number a...
Zizhong Chen, Jack Dongarra
77
Voted
UC
2009
Springer
15 years 4 months ago
Random Number Selection in Self-assembly
Abstract. We investigate methods for exploiting nondeterminism inherent within the Tile Assembly Model in order to generate uniform random numbers. Namely, given an integer range {...
David Doty, Jack H. Lutz, Matthew J. Patitz, Scott...