Sciweavers

1369 search results - page 4 / 274
» Lattice computations for random numbers
Sort
View
JCAM
2011
78views more  JCAM 2011»
12 years 10 months ago
Symmetric box-splines on root lattices
Root lattices are efficient sampling lattices for reconstructing isotropic signals in arbitrary dimensions, due to their highly symmetric structure. One root lattice, the Cartesia...
Minho Kim, Jörg Peters
SACRYPT
1998
Springer
13 years 11 months ago
Computational Alternatives to Random Number Generators
In this paper, we present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accident...
David M'Raïhi, David Naccache, David Pointche...
CSC
2006
13 years 9 months ago
Parallel Computations Reveal Hidden Errors of Commonly Used Random Number Generators
This paper reports that in parallel Monte-Carlo simulations of the 2D Ising-Model, commonly used pseudo-random number generators (PRNG) lead to manifestly erroneous results. When ...
Hyo Ashihara, Ai Kuramoto, Isaku Wada, Makoto Mats...
CORR
2008
Springer
68views Education» more  CORR 2008»
13 years 7 months ago
Three-dimensional Random Voronoi Tessellations: From Cubic Crystal Lattices to Poisson Point Processes
We perturb the simple cubic (SC), body-centered cubic (BCC), and face-centered cubic (FCC) structures with a spatial Gaussian noise whose adimensional strength is controlled by th...
Valerio Lucarini
SODA
2012
ACM
235views Algorithms» more  SODA 2012»
11 years 10 months ago
Fast zeta transforms for lattices with few irreducibles
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...
Andreas Björklund, Mikko Koivisto, Thore Husf...