R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT.
Sameer PawarKannan RamchandranPublished in: IEEE Trans. Inf. Theory (2018)
Keyphrases
- learning algorithm
- detection algorithm
- computationally efficient
- experimental evaluation
- worst case
- computational complexity
- preprocessing
- parameter tuning
- probabilistic model
- optimization algorithm
- theoretical analysis
- cost function
- k means
- computational cost
- dynamic programming
- matching algorithm
- expectation maximization
- np hard
- frequency domain
- high accuracy
- times faster
- simple polygon
- segmentation algorithm
- linear programming
- simulated annealing
- significant improvement
- similarity measure