1369 search results - page 7 / 274 » Lattice computations for random numbers |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
DCG
1999
13 years 7 months ago
1999
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
ICS
1998
Tsinghua U.
13 years 11 months ago
1998
Tsinghua U.
Parallel computers are now commonly used for computational science and engineering, and many applications in these areas use random number generators. For some applications, such ...
ERSA
2006
13 years 9 months ago
2006
Reconfigurable computing offers an attractive solution to accelerating infrared scene simulations. In infrared scene simulations, the modeling of a number of atmospheric and optic...