Sciweavers

2312 search results - page 312 / 463
» The complexity of estimating min-entropy
Sort
View
VLSID
1999
IEEE
100views VLSI» more  VLSID 1999»
15 years 11 months ago
Improved Effective Capacitance Computations for Use in Logic and Layout Optimization
We describe an improved iterationless approach for computing the effective capacitance of an interconnect load at a driving gate output. The speed and accuracy of our approach mak...
Andrew B. Kahng, Sudhakar Muddu
ASIACRYPT
1998
Springer
15 years 11 months ago
Analysis Methods for (Alleged) RC4
Abstract. The security of the alleged RC4 stream cipher and some variants is investigated. Cryptanalytic algorithms are developed for a known plaintext attack where only a small se...
Lars R. Knudsen, Willi Meier, Bart Preneel, Vincen...
IPPS
1996
IEEE
15 years 11 months ago
A Parallel Algorithm for Minimization of Finite Automata
In this paper, we present a parallel algorithm for the minimization of deterministic finite state automata (DFA's) and discuss its implementation on a connection machine CM-5...
Bala Ravikumar, X. Xiong
KR
1992
Springer
15 years 11 months ago
Order of Magnitude Reasoning using Logarithms
Converting complex equations into simpler, more tractable equations usually involves approximation. Approximation is usually done by identifying and removing insignificant terms, ...
P. Pandurang Nayak
GLOBECOM
2009
IEEE
15 years 10 months ago
A Subspace Method for the Blind Identification of Multiple Time-Varying FIR Channels
A new method is proposed for the blind subspace-based identification of the coefficients of time-varying (TV) single-input multiple-output (SIMO) FIR channels. The TV channel coef...
Benoît Champagne, Amr El-Keyi, Chao-Cheng Tu