A deterministic sparse FFT algorithm for vectors with small support.
Gerlind PlonkaKatrin WannenwetschPublished in: CoRR (2015)
Keyphrases
- learning algorithm
- dynamic programming
- computational complexity
- optimization algorithm
- preprocessing
- input data
- significant improvement
- cost function
- neural network
- linear programming
- high accuracy
- experimental evaluation
- principal components
- matching algorithm
- simulated annealing
- worst case
- probabilistic model
- computational cost
- np hard
- k means
- search space
- genetic algorithm