Probabilistic complexity analysis of incremental DFT algorithms.
Joseph M. WinogradS. Hamid NawabPublished in: ICASSP (1997)
Keyphrases
- complexity analysis
- theoretical analysis
- computational cost
- learning algorithm
- optimization problems
- incremental version
- real time
- recently developed
- computational efficiency
- computationally efficient
- data driven
- probabilistic model
- computational complexity
- search algorithm
- bayesian networks
- clustering algorithm
- multiresolution
- lower bound
- search engine
- benchmark datasets
- data structure
- reinforcement learning
- convergence rate
- face recognition