Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Paper
The multiplicative complexity of discrete cosine transforms
Abstract
We obtain the multiplicative complexity of discrete cosine transforms in all cases. It is given as a function of the multiplicative complexity of discrete Fourier transforms. The latter have all been determined previously. © 1992.
Related
Conference paper
Modeling polarization for Hyper-NA lithography tools and masks
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics