Improved bounds for a deterministic sublinear-time Sparse Fourier Algorithm.
Mark A. IwenCraig V. SpencerPublished in: CISS (2008)
Keyphrases
- improved algorithm
- worst case
- dynamic programming
- high accuracy
- average case
- optimal solution
- error bounds
- optimization algorithm
- learning algorithm
- computational cost
- detection algorithm
- randomized algorithms
- recognition algorithm
- np hard
- preprocessing
- experimental evaluation
- upper bound
- linear programming
- search space
- similarity measure
- theoretical guarantees
- lower bound
- theoretical analysis
- computational complexity
- sparse representation
- data structure
- convergence rate
- neural network
- binary search trees
- k means