274 search results - page 21 / 55 » Counting lattice vectors |
FSTTCS
2008
Springer
15 years 24 days ago
2008
Springer
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
— Low density lattice codes (LDLC) are novel lattice codes that can be decoded efficiently and approach the capacity of the additive white Gaussian noise (AWGN) channel. In LDLC...
105
click to vote
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
Poisson regression models the noisy output of a counting function as a Poisson random variable, with a log-mean parameter that is a linear function of the input vector. In this wo...
100
click to vote
CPC
2000
14 years 11 months ago
2000
This paper describes methods for counting the number of non-negative integer solutions of the system Ax = b when A is a non-negative totally unimodular matrix and b an integral ve...
246
click to vote
C3S2E
2011
ACM
14 years 3 months ago
2011
ACM
The LLL algorithm is a well-known and widely used lattice basis reduction algorithm. In many applications, its speed is critical. Parallel computing can improve speed. However, th...