On the Computational Complexity of Bongartz's Algorithm.
Andrzej MrózPublished in: Fundam. Informaticae (2013)
Keyphrases
- computational complexity
- detection algorithm
- learning algorithm
- dynamic programming
- theoretical analysis
- experimental evaluation
- computational cost
- experimental study
- preprocessing
- particle swarm optimization
- single pass
- np hard
- similarity measure
- segmentation algorithm
- computationally efficient
- computational efficiency
- significant improvement
- search space
- optimal solution
- estimation algorithm
- neural network
- k means
- high computational complexity
- improved algorithm
- memory requirements
- search algorithm
- classification algorithm
- feature selection
- optimization algorithm
- image processing
- high accuracy
- worst case
- state space
- objective function
- cost function
- special case