Faster algorithms for computing Hong's bound on absolute positiveness.
Kurt MehlhornSaurabh RayPublished in: J. Symb. Comput. (2010)
Keyphrases
- worst case
- data structure
- computational cost
- computationally efficient
- optimization problems
- upper bound
- significant improvement
- computational complexity
- theoretical analysis
- orders of magnitude
- computationally expensive
- recently developed
- error bounds
- semi supervised
- image segmentation
- benchmark datasets
- computational efficiency
- times faster