Sciweavers

1369 search results - page 2 / 274
» Lattice computations for random numbers
Sort
View
ANTS
2010
Springer
262views Algorithms» more  ANTS 2010»
15 years 1 months ago
Short Bases of Lattices over Number Fields
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
Claus Fieker, Damien Stehlé
CORR
2010
Springer
171views Education» more  CORR 2010»
14 years 9 months ago
Randomized Lattice Decoding
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...
Shuiyin Liu, Cong Ling, Damien Stehlé
ECSQARU
2005
Springer
15 years 3 months ago
Consonant Random Sets: Structure and Properties
In this paper, we investigate consonant random sets from the point of view of lattice theory. We introduce a new definition of consonancy and study its relationship with possibili...
Enrique Miranda
JCAM
2010
108views more  JCAM 2010»
14 years 4 months ago
Lattices on simplicial partitions
In this paper, (d + 1)-pencil lattices on simplicial partitions in Rd are studied. The barycentric approach naturally extends the lattice from a simplex to a simplicial partition,...
Gasper Jaklic, Jernej Kozak, Marjeta Krajnc, Vito ...
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
15 years 10 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson