Researchers have developed a new algorithm that, in a large range of practically important cases, improves on the fast Fourier transform. Under some circumstances, the improvement can be dramatic -- a ...

In January, four MIT researchers showed off a replacement for one of the most important algorithms in computer science. Dina Katabi, Haitham Hassanieh, Piotr Indyk, and Eric Price have created a ...

The FFT (Fast Fourier Transform) is rightfully regarded as the most important numerical algorithm of our lifetime. Whether it's used to monitor signals coming from the depths of the earth or search ...

The Fourier transform is one of the most fundamental concepts in the information sciences. It's a method for representing an irregular signal — such as the voltage fluctuations in the wire that ...

For a large range of practically useful cases, MIT researchers find a way to increase the speed of one of the most important algorithms in the information sciences. The Fourier transform is one of the ...

At the Association for Computing Machinery's Symposium on Discrete Algorithms (SODA), a group of MIT researchers will present a new algorithm that, in a large range of practically important cases, ...