Sciweavers

2887 search results - page 54 / 578
» Name Generation and Linearity
Sort
View
SAS
2010
Springer
143views Formal Methods» more  SAS 2010»
15 years 4 months ago
Points-to Analysis as a System of Linear Equations
The efficiency of a points-to analysis is critical for several compiler optimizations and transformations, and has attracted considerable research attention. Despite several advanc...
Rupesh Nasre, Ramaswamy Govindarajan
DAC
1996
ACM
15 years 10 months ago
Computing Parametric Yield Adaptively Using Local Linear Models
Abstract A divide-and-conquer algorithm for computing the parametric yield of large analog circuits is presented. The algorithm targets applications whose performance spreads could...
Mien Li, Linda S. Milor
CRYPTO
2006
Springer
89views Cryptology» more  CRYPTO 2006»
15 years 9 months ago
Oblivious Transfer and Linear Functions
Abstract. We study unconditionally secure 1-out-of-2 Oblivious Transfer (1-2 OT). We first point out that a standard security requirement for 1-2 OT of bits, namely that the receiv...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
APCCAS
2006
IEEE
206views Hardware» more  APCCAS 2006»
15 years 9 months ago
On the Properties And Design of Stable IIR Transfer Functions Generated Using Fibonnaci Numbers
This paper considers z-domain transfer functions whose denominator polynomial possesses the property that the coefficient of zi is greater than the coefficient of zi-1 . Such trans...
Christian S. Gargour, Venkat Ramachandran, Ravi P....
VLSID
2003
IEEE
103views VLSI» more  VLSID 2003»
16 years 6 months ago
Minimum Dynamic Power CMOS Circuit Design by a Reduced Constraint Set Linear Program
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
Tezaswi Raja, Vishwani D. Agrawal, Michael L. Bush...