An efficient algorithm for the k maximum convex sums.
Mohammed ThaherTadao TakaokaPublished in: ICCS (2010)
Keyphrases
- matching algorithm
- learning algorithm
- experimental evaluation
- high accuracy
- computational complexity
- preprocessing
- probabilistic model
- computational cost
- np hard
- detection algorithm
- computationally efficient
- times faster
- dynamic programming
- cost function
- k means
- convex optimization
- optimal solution
- objective function
- convex hull
- globally optimal
- worst case
- theoretical analysis
- simulated annealing
- significant improvement
- search space
- clustering method
- tree structure
- expectation maximization
- lower bound
- memory efficient
- constrained minimization