Sciweavers

308 search results - page 17 / 62
» Fast Comparisons of Circuit Implementations
Sort
View
FP
1989
124views Formal Methods» more  FP 1989»
15 years 3 months ago
Deriving the Fast Fourier Algorithm by Calculation
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
Geraint Jones
SIGPRO
2008
89views more  SIGPRO 2008»
14 years 11 months ago
Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform
: In this letter, an efficient algorithm for three-dimensional (3-D) vector radix decimation in frequency is derived for computing the type-III 3-D discrete W transform (DWT). Comp...
Huazhong Shu, J. S. Wu, Lotfi Senhadji, Limin Luo
MST
2002
107views more  MST 2002»
14 years 11 months ago
A Comparison of Asymptotically Scalable Superscalar Processors
The poor scalability of existing superscalar processors has been of great concern to the computer engineering community. In particular, the critical-path lengths of many components...
Bradley C. Kuszmaul, Dana S. Henry, Gabriel H. Loh
GCB
2008
Springer
174views Biometrics» more  GCB 2008»
15 years 27 days ago
Lightweight Comparison of RNAs based on Exact Sequence-structure Matches
: Specific functions of RNA molecules are often associated with different motifs in the RNA structure. The key feature that forms such an RNA motif is the combination of sequence ...
Steffen Heyne, Sebastian Will, Michael Beckstette,...
CN
2010
134views more  CN 2010»
14 years 10 months ago
TCP Libra: Derivation, analysis, and comparison with other RTT-fair TCPs
— The Transmission Control Protocol (TCP), the most widely used transport protocol over the Internet, has been advertised to implement fairness between flows competing for the s...
Gustavo Marfia, Claudio E. Palazzi, Giovanni Pau, ...