245 search results - page 16 / 49 » A Fast Fourier Transform Compiler |
HASKELL
2009
ACM
14 years 1 months ago
2009
ACM
Data-type generic programming can be used to traverse and manipulate specific parts of large heterogeneously-typed tree structures, without the need for tedious boilerplate. Gene...
SIAMSC
2010
13 years 2 months ago
2010
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
CC
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This paper introduces a method to generate efficient vectorized implementations of small stride permutations using only vector load and vector shuffle instructions. These...
CRYPTO
2004
Springer
14 years 24 days ago
2004
Springer
Recently proposed algebraic attacks [2, 6] and fast algebraic attacks [1, 5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exp...
119
click to vote
Book
C code implementation of several math algorithms such as Linear Algebraic Equations,
Interpolation and Extrapolation, Integration of Functions, Evaluation of Functions, Random Num...