Sciweavers

31 search results - page 3 / 7
» The Space Complexity of Approximating the Frequency Moments
Sort
View
DAC
2003
ACM
14 years 6 months ago
Efficient model order reduction including skin effect
Skin effect makes interconnect resistance and inductance frequency dependent. This paper addresses the problem of efficiently estimating the signal characteristics of any RLC netw...
Shizhong Mei, Chirayu S. Amin, Yehea I. Ismail
EURODAC
1994
IEEE
127views VHDL» more  EURODAC 1994»
13 years 10 months ago
Optimal equivalent circuits for interconnect delay calculations using moments
In performance-driven interconnect design, delay estimators are used to determine both the topology and the layout of good routing trees. We address the class of moment-matching, ...
Sudhakar Muddu, Andrew B. Kahng
ESA
2007
Springer
121views Algorithms» more  ESA 2007»
13 years 12 months ago
Finding Frequent Elements in Non-bursty Streams
We present an algorithm for finding frequent elements in a stream where the arrivals are not bursty. Depending on the amount of burstiness in the stream our algorithm detects elem...
Rina Panigrahy, Dilys Thomas
APPROX
2009
Springer
118views Algorithms» more  APPROX 2009»
14 years 11 days ago
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
T. S. Jayram
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 3 months ago
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
Amit Chakrabarti, Oded Regev