A detailed complexity model for multiple constant multiplication and an algorithm to minimize the complexity.
Kenny JohanssonOscar GustafssonLars WanhammarPublished in: ECCTD (2005)
Keyphrases
- space complexity
- worst case
- computational complexity
- probabilistic model
- mathematical model
- computational cost
- multiple models
- theoretical analysis
- recognition algorithm
- kalman filter
- optimization model
- cost function
- algorithm employs
- objective function
- input data
- final result
- preprocessing
- bayesian framework
- estimation algorithm
- linear programming
- complexity analysis
- memory requirements
- lower complexity
- prior information
- parameter estimation
- optimization algorithm
- closed form
- algorithm has been developed
- tree structure
- classification algorithm
- filtering algorithm
- decision problems
- polynomial time complexity
- optimal solution
- search space
- k means
- dynamic programming
- feature selection
- matching algorithm
- image sequences
- similarity measure
- significant improvement
- np hard
- probability distribution
- markov random field
- graphical models
- particle swarm optimization
- em algorithm
- segmentation algorithm
- clustering method