341 search results - page 49 / 69 » Quantum Computation and Lattice Problems |
PAMI
1998
13 years 7 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 ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
Abstract— This paper presents a post-route gate-sizing algorithm for coupling-noise reduction that constrains the yield loss under process variations. Algorithms for coupling-noi...
COMPUTING
2006
13 years 7 months ago
2006
Sparse grid methods represent a powerful and efficient technique for the representation and approximation of functions and particularly the solutions of partial differential equat...