CHOP: Bypassing Runtime Bounds Checking Through Convex Hull OPtimization.
Yurong ChenHongfa XueTian LanGuru VenkataramaniPublished in: CoRR (2019)
Keyphrases
- convex hull
- convex combinations
- feasible solution
- mixed integer
- point sets
- linear inequalities
- convex polyhedra
- computational geometry
- optimization problems
- extreme points
- simple polygon
- combinatorial optimization
- upper bound
- convex sets
- minimum distance
- machine learning
- integer points
- convex concave
- training samples
- data points
- decision trees
- learning algorithm