A General Definition of the O-notation for Algorithm Analysis.
Kalle RutanenGermán Gómez-HerreroSirkka-Liisa ErikssonKaren O. EgiazarianPublished in: Bull. EATCS (2015)
Keyphrases
- computational cost
- segmentation algorithm
- np hard
- learning algorithm
- times faster
- special case
- search space
- computational complexity
- optimal solution
- k means
- path planning
- high accuracy
- classification algorithm
- machine learning
- matching algorithm
- computationally efficient
- linear programming
- improved algorithm
- worst case
- single pass
- experimental evaluation
- significant improvement
- data sets
- dynamic programming
- cost function
- expectation maximization
- data analysis
- optimization algorithm
- ant colony optimization
- objective function
- similarity measure
- image segmentation
- image processing
- genetic algorithm