Conference paper
Social networks and discovery in the enterprise (SaND)
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
Paper
On the Multiplicative Complexity of Discrete Cosine Transforms
Abstract
The multiplicative complexity of discrete cosine transforms (DCT’s) of arbitrary dimensions on inputs sizes, which are powers of two, are obtained. New upper bounds on the multiplicative complexity of scaled DCT’s on input sizes, which are powers of two, are also obtained. © 1992 IEEE
Related
Robert C. Durbeck
IEEE TACON
Conference paper
Low-Resource Speech Recognition of 500-Word Vocabularies
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Thomas R. Puzak, A. Hartstein, et al.
CF 2007