Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy.
Michael GnewuchPublished in: J. Complex. (2024)
Keyphrases
- worst case
- randomized algorithm
- high accuracy
- lower and upper bounds
- improved algorithm
- detection algorithm
- error bounds
- computational complexity
- cost function
- optimal solution
- average case
- space complexity
- probabilistic model
- computational cost
- upper bound
- preprocessing
- experimental evaluation
- lower bound
- theoretical guarantees
- theoretical analysis
- upper and lower bounds
- single scan
- contingency tables
- computational effort
- convergence rate
- memory requirements
- dynamic programming
- linear programming
- segmentation algorithm
- matching algorithm
- times faster
- optimization algorithm
- multi objective
- search algorithm
- particle swarm optimization
- image quality
- constant factor
- tight bounds
- similarity measure
- linear threshold
- branch and bound search
- error tolerance
- greedy algorithm