598 search results - page 11 / 120 » Predicting Lattice Reduction |
62
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
125
Voted
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
109
Voted
ASPDAC
2005
ACM
15 years 5 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...
141
Voted
WSC
1998
15 years 5 months ago
1998
This paper compares Monte Carlo methods, lattice rules, and other low-discrepancy point sets on the problem of evaluating asian options. The combination of these methods with vari...
222
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Despite the surge of interest in data reduction techniques over the past years, no method has been proposed to date that can always achieve approximation quality preferable to that...