Sciweavers

534 search results - page 47 / 107
» Efficient polynomial L-approximations
Sort
View
GLVLSI
2003
IEEE
219views VLSI» more  GLVLSI 2003»
14 years 1 months ago
Buffer sizing for minimum energy-delay product by using an approximating polynomial
This paper first presents an accurate and efficient method of estimating the short circuit energy dissipation and the output transition time of CMOS buffers. Next the paper descri...
Chang Woo Kang, Soroush Abbaspour, Massoud Pedram
MUE
2007
IEEE
104views Multimedia» more  MUE 2007»
14 years 2 months ago
A Conference Key Distribution Scheme Using Interpolating Polynomials
Conference keys are secret keys used by a group of users commonly and with which they can encipher (or decipher) messages such that communications are secure. Based on the Diffie ...
Chin-Chen Chang, Chu-Hsing Lin, Chien-Yuan Chen
DAC
2009
ACM
14 years 8 months ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert
AMW
2010
13 years 9 months ago
Multiresolution Cube Estimators for Sensor Network Aggregate Queries
In this work we present in-network techniques to improve the efficiency of spatial aggregate queries. Such queries are very common in a sensornet setting, demanding more targeted t...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
DLT
2008
13 years 9 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...