An improved reliability bound of a probabilistic parallel integer sorting algorithm.
Alexandros V. GerbessiotisPublished in: Inf. Process. Lett. (2012)
Keyphrases
- worst case
- probabilistic model
- theoretical analysis
- times faster
- experimental evaluation
- learning algorithm
- computationally efficient
- dynamic programming
- k means
- posterior probability
- objective function
- high accuracy
- clustering method
- input data
- detection algorithm
- parallel processing
- error bounds
- recognition algorithm
- hardware implementation
- sorting algorithms
- optimization algorithm
- particle swarm optimization
- linear programming
- cost function
- optimal solution
- segmentation algorithm
- ant colony optimization
- matching algorithm
- upper bound
- convex hull
- significant improvement
- bayesian networks
- feature selection
- neural network