The Fast Fourier Transform (FFT) is an implementation of the Discrete Fourier Transform (DFT) using a divide-and-conquer approach. A DFT can transform any discrete signal, such as an image, to and ...

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, ...

FFT-EM is an innovative method that represents a combination of FFT and EM techniques such as scanning electron microscopy (SEM). The technique is often used to determine the interior and surface ...

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 ...