An Efficient Construction Algorithm for a Class of Implicit Double-Ended Priority Queues.
Jingsen ChenPublished in: Comput. J. (1995)
Keyphrases
- computationally efficient
- times faster
- experimental evaluation
- worst case
- multi class classification
- improved algorithm
- high accuracy
- k means
- computational complexity
- learning algorithm
- neural network
- np hard
- optimal solution
- recognition algorithm
- similarity measure
- highly efficient
- tree structure
- detection algorithm
- optimization algorithm
- objective function
- data sets
- computational cost
- input data
- lower bound
- segmentation algorithm
- simulated annealing
- clustering method
- matching algorithm
- feature selection
- convergence rate
- dynamic programming
- significant improvement
- search space