A bisection algorithm for the mixed μ upper bound and its supremum.
Carl-Magnus FranssonMichael A. SaundersPublished in: ACC (2004)
Keyphrases
- upper bound
- learning algorithm
- worst case
- preprocessing
- experimental evaluation
- detection algorithm
- computational complexity
- dynamic programming
- significant improvement
- optimization algorithm
- particle swarm optimization
- segmentation algorithm
- times faster
- selection algorithm
- theoretical analysis
- estimation algorithm
- recognition algorithm
- lower bound
- cost function
- data streams
- data sets
- improved algorithm
- neural network
- similarity measure
- convex hull
- combinatorial optimization
- optimal solution
- clustering method
- artificial neural networks
- search space
- computationally efficient
- expectation maximization
- k means
- linear programming
- simulated annealing