FFAST: An Algorithm for Computing an Exactly k-Sparse DFT in O(k log k) Time.
Sameer PawarKannan RamchandranPublished in: IEEE Trans. Inf. Theory (2018)
Keyphrases
- learning algorithm
- high accuracy
- dynamic programming
- objective function
- improved algorithm
- detection algorithm
- optimization algorithm
- experimental evaluation
- computational cost
- theoretical guarantees
- tree structure
- computational complexity
- cost function
- mobile robot
- significant improvement
- worst case
- lower bound
- expectation maximization
- segmentation algorithm
- preprocessing
- optimal solution
- matching algorithm
- times faster
- fourier transform
- bayesian networks
- negative matrix factorization
- image processing