242 search results - page 31 / 49 » Fast computation of general Fourier Transforms on GPUS |
103
click to vote
STOC
2004
ACM
15 years 11 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
COMPGEOM
2009
ACM
14 years 9 months ago
2009
ACM
Computed tomography(CT), especially since the introduction of helical CT, provides excellent visualization of the internal organs of the body. As a result, CT is used routinely in...
102
click to vote
ICS
2007
Tsinghua U.
15 years 5 months ago
2007
Tsinghua U.
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
104
Voted
FTTCS
2006
14 years 11 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we propose a systemic approach for synthesizing field-programmable gate array (FPGA) implementations of fast Fourier transform (FFT) computations. Our approach cons...