Sciweavers

1369 search results - page 9 / 274
» Lattice computations for random numbers
Sort
View
COMBINATORICS
1999
139views more  COMBINATORICS 1999»
13 years 8 months ago
A Closer Look at Lattice Points in Rational Simplices
Abstract. We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n + 1...
Matthias Beck
PDCAT
2007
Springer
14 years 2 months ago
High Throughput Multi-port MT19937 Uniform Random Number Generator
ct There have been many previous attempts to accelerate MT19937 using FPGAs but we believe that we can substantially improve the previous implementations to develop a higher throug...
Vinay Sriram, David Kearney
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 6 months ago
Approximately achieving Gaussian relay network capacity with lattice codes
Abstract--Recently, it has been shown that a quantize-mapand-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitr...
Ayfer Özgür, Suhas N. Diggavi
ICDE
2007
IEEE
151views Database» more  ICDE 2007»
14 years 10 months ago
Computing Compressed Multidimensional Skyline Cubes Efficiently
Recently, the skyline computation and analysis have been extended from one single full space to multidimensional subspaces, which can lead to valuable insights in some application...
Jian Pei, Ada Wai-Chee Fu, Xuemin Lin, Haixun Wang
EMNLP
2010
13 years 6 months ago
Minimum Error Rate Training by Sampling the Translation Lattice
Minimum Error Rate Training is the algorithm for log-linear model parameter training most used in state-of-the-art Statistical Machine Translation systems. In its original formula...
Samidh Chatterjee, Nicola Cancedda