25 search results - page 2 / 5 » On the Limits of Nonapproximability of Lattice Problems |
ICIP
1998
IEEE
14 years 7 months ago
1998
IEEE
: An explicit formula is presented for reconstructing a This article derives an explicit formula for the integer values finite-support object defined on a lattice of points and tak...
INDOCRYPT
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Consider the RSA public key cryptosystem with the parameters N = pq, q < p < 2q, public encryption exponent e and private decryption exponent d. In this paper, cryp...
IPSN
2004
Springer
13 years 11 months ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
Parallel computation of the adaptive lattice filtering algorithm is difficult due to the dependency problem caused by feedback operations. The conventional control-level paralle...
CPM
2004
Springer
13 years 11 months ago
2004
Springer
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...