Sciweavers

73 search results - page 8 / 15
» FPGA-optimised high-quality uniform random number generators
Sort
View
FSE
2005
Springer
108views Cryptology» more  FSE 2005»
14 years 7 days ago
Unbiased Random Sequences from Quasigroup String Transformations
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
Smile Markovski, Danilo Gligoroski, Ljupco Kocarev
SMI
2006
IEEE
106views Image Analysis» more  SMI 2006»
14 years 22 days ago
Fast Sampling of Implicit Surfaces by Particle Systems
Particle systems, as originally proposed by Witkin and Heckbert [17], are a powerful way to sample implicit surfaces since they generate almost evenly distributed samples over the...
Florian Levet, Xavier Granier, Christophe Schlick
ICDT
1999
ACM
72views Database» more  ICDT 1999»
13 years 11 months ago
On the Generation of 2-Dimensional Index Workloads
A large number of database index structures have been proposed over the last two decades, and little consensus has emerged regarding their relative e ectiveness. In order to empir...
Joseph M. Hellerstein, Lisa Hellerstein, George Ko...
ICC
2007
IEEE
137views Communications» more  ICC 2007»
14 years 1 months ago
On the Simulation of Tikhonov Random Processes
Abstract— A novel, simple and efficient method for the generation of Tikhonov (a.k.a. von Mises) random variates is proposed. In the proposed method, circular variates of a pres...
Giuseppe Thadeu Freitas de Abreu
COMPSAC
2008
IEEE
14 years 1 months ago
Constraint Reasoning in Path-Oriented Random Testing
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. T...
Arnaud Gotlieb, Matthieu Petit