25 search results - page 3 / 5 » On the Limits of Nonapproximability of Lattice Problems |
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
ICCS
2003
Springer
15 years 2 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
CDC
2008
IEEE
14 years 11 months ago
2008
IEEE
We consider the role of topological dimension in problems of network consensus and vehicular formations where only local feedback is available. In particular, we consider the simpl...
DCC
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper considers the problem of transmitting the difference of two positively correlated Gaussian sources over a two-user additive Gaussian noise multiple access channel (MAC)...
68
Voted
PAMI
1998
14 years 9 months ago
1998
—In this paper, we give a detailed analysis of the accuracy of Zernike moments in terms of their discretization errors and the reconstruction power. It is found that there is an ...