Sciweavers

4581 search results - page 15 / 917
» Computing Transformation Semigroups
Sort
View
ICIP
2001
IEEE
14 years 9 months ago
New algorithms for computing directional discrete Fourier transforms
New algorithms for computing the Discrete Fourier Transform (DFT) spectra along different directions are derived and implemented. For computing the DFT spectrum along any given di...
Marios S. Pattichis, Ruhai Zhou, Balaji Raman 0002
AICCSA
2006
IEEE
168views Hardware» more  AICCSA 2006»
14 years 1 months ago
Power Efficient Algorithms for Computing Fast Fourier Transform over Wireless Sensor Networks
Collaborative signal processing is one of the most promising applications that are currently being investigated for sensor networks. In this paper, we use FFT computation as a veh...
Turkmen Canli, Ajay K. Gupta, Ashfaq A. Khokhar
ICS
2009
Tsinghua U.
14 years 2 months ago
Computer generation of fast fourier transforms for the cell broadband engine
The Cell BE is a multicore processor with eight vector accelerators (called SPEs) that implement explicit cache management through direct memory access engines. While the Cell has...
Srinivas Chellappa, Franz Franchetti, Markus P&uum...
BILDMED
2008
124views Algorithms» more  BILDMED 2008»
13 years 8 months ago
Non-equispaced Fourier Transform Vs. Polynomial-Based Metal Artifact Reduction in Computed Tomography
We propose a method, which treats metal artifact reduction in CT by sinogram restoration as a problem of scattered data interpolation. Corrupted sinogram entries are discarded and ...
Bärbel Kratz, Tobias Knopp, Jan Müller 0...
CORR
2000
Springer
81views Education» more  CORR 2000»
13 years 7 months ago
Poly-locality in quantum computing
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
Michael H. Freedman