Sciweavers

1369 search results - page 22 / 274
» Lattice computations for random numbers
Sort
View
COCO
2004
Springer
147views Algorithms» more  COCO 2004»
14 years 16 days ago
The Complexity of the Covering Radius Problem on Lattices and Codes
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
Venkatesan Guruswami, Daniele Micciancio, Oded Reg...
JUCS
2006
97views more  JUCS 2006»
13 years 8 months ago
An Interval Constraint Branching Scheme for Lattice Domains
This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction probl...
Antonio J. Fernández, Patricia M. Hill
COMPGEOM
2004
ACM
14 years 2 months ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue
COMGEO
2006
ACM
13 years 8 months ago
Inner and outer rounding of Boolean operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementat...
Olivier Devillers, Philippe Guigue
JUCS
2006
114views more  JUCS 2006»
13 years 8 months ago
Pseudorandom Number Generation: Impossibility and Compromise
Abstract: Pseudorandom number generators are widely used in the area of simulation. Defective generators are still widely used in standard library programs, although better pseudor...
Makoto Matsumoto, Mutsuo Saito, Hiroshi Haramoto, ...