Norm and an Improved Complexity Bound for Radzik's Algorithm.
Qin WangXiaoguang YangJianzhong ZhangPublished in: J. Glob. Optim. (2006)
Keyphrases
- worst case
- computational complexity
- dynamic programming
- learning algorithm
- probabilistic model
- objective function
- detection algorithm
- theoretical analysis
- preprocessing
- segmentation algorithm
- cost function
- significant improvement
- recognition algorithm
- improved algorithm
- space complexity
- complexity bounds
- computationally efficient
- simulated annealing
- optimization algorithm
- matching algorithm
- linear complexity
- linear programming
- experimental evaluation
- k means
- bayesian networks
- particle swarm optimization
- input data
- data sets
- classification algorithm
- times faster
- reinforcement learning
- similarity measure
- genetic algorithm
- neural network