A general definition of the big-oh notation for algorithm analysis.
Kalle RutanenGermán Gómez-HerreroSirkka-Liisa ErikssonKaren O. EgiazarianPublished in: CoRR (2013)
Keyphrases
- objective function
- cost function
- np hard
- experimental evaluation
- improved algorithm
- times faster
- computational complexity
- segmentation algorithm
- special case
- learning algorithm
- recognition algorithm
- detection algorithm
- linear programming
- worst case
- dynamic programming
- preprocessing
- clustering method
- single pass
- data sets
- artificial neural networks
- particle swarm optimization
- simulated annealing
- computational cost
- optimization algorithm
- search space
- experimental study
- classification algorithm
- matching algorithm
- search algorithm
- convergence rate
- optimal solution
- k means