A faster algorithm for the resource allocation problem with convex cost functions.
Cong ShiHuanan ZhangChao QinPublished in: J. Discrete Algorithms (2015)
Keyphrases
- cost function
- times faster
- dynamic programming
- learning algorithm
- experimental evaluation
- worst case
- preprocessing
- computational complexity
- computational cost
- high accuracy
- matching algorithm
- theoretical analysis
- improved algorithm
- convex hull
- globally optimal
- memory efficient
- optimization algorithm
- computationally efficient
- expectation maximization
- k means
- similarity measure
- significant improvement
- search space
- highly efficient
- space complexity
- objective function