Probabilistic complexity analysis for a class of approximate DFT algorithms.
Joseph M. WinogradS. Hamid NawabPublished in: J. VLSI Signal Process. (1996)
Keyphrases
- complexity analysis
- theoretical analysis
- orders of magnitude
- learning algorithm
- exact and approximate
- computational efficiency
- computational complexity
- computational cost
- times faster
- computationally efficient
- optimization problems
- image processing
- approximate solutions
- probabilistic networks
- data sets
- probabilistic approaches
- exact computation