New polynomial transform algorithms for fast DFT computation.
Henri J. NussbaumerPhilippe QuandallePublished in: ICASSP (1979)
Keyphrases
- computationally expensive
- times faster
- computational cost
- optimization problems
- data sets
- learning algorithm
- upper bound
- benchmark datasets
- computer vision algorithms
- genetic algorithm
- computer vision
- computational complexity
- feature vectors
- significant improvement
- constraint satisfaction problems
- exact computation