Sciweavers

256 search results - page 13 / 52
» Recursive Lattice Reduction
Sort
View
COMBINATORICS
1998
100views more  COMBINATORICS 1998»
13 years 7 months ago
Lattice Paths Between Diagonal Boundaries
A bivariate symmetric backwards recursion is of the form d[m, n] = w0(d[m− 1, n]+d[m, n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m−sk, ...
Heinrich Niederhausen
ASPDAC
2005
ACM
123views Hardware» more  ASPDAC 2005»
13 years 9 months ago
Yield driven gate sizing for coupling-noise reduction under uncertainty
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...
Debjit Sinha, Hai Zhou
WSC
1998
13 years 9 months ago
Efficiency Improvement by Lattice Rules for Pricing Asian Options
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...
Christiane Lemieux, Pierre L'Ecuyer
STACS
2007
Springer
14 years 1 months ago
On the Automatic Analysis of Recursive Security Protocols with XOR
Abstract. In many security protocols, such as group protocols, principals have to perform iterative or recursive computations. We call such protocols recursive protocols. Recently,...
Ralf Küsters, Tomasz Truderung
ICDE
2008
IEEE
155views Database» more  ICDE 2008»
14 years 9 months ago
Lattice Histograms: a Resilient Synopsis Structure
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...
Panagiotis Karras, Nikos Mamoulis