266 search results - page 7 / 54 » New algorithms for computing directional discrete Fourier tr... |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
—This paper improves on the best-known runtime and measurement bounds for a recently proposed Deterministic sublinear-time Sparse Fourier Transform algorithm (hereafter called DS...
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
This paper proposes a new memory system called shuffle memory. The shuffle memory is a generalization of transposition memory that has been widely used in 2-D Discrete Cosine Tran...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...