A note on E. Thiémard's algorithm to compute bounds for the star discrepancy.
Tim PillardsRonald CoolsPublished in: J. Complex. (2005)
Keyphrases
- worst case
- computational cost
- cost function
- times faster
- dynamic programming
- learning algorithm
- optimization algorithm
- theoretical analysis
- optimal solution
- computational complexity
- np hard
- average case
- matching algorithm
- error bounds
- convergence rate
- significant improvement
- probabilistic model
- theoretical guarantees
- lower bound
- data sets
- recognition algorithm
- confidence bounds
- space complexity
- approximation algorithms
- convex hull
- computationally efficient
- multi class
- upper bound
- experimental evaluation