A Geometric Approach for the Upper Bound Theorem for Minkowski Sums of Convex Polytopes.
Menelaos I. KaravelasEleni TzanakiPublished in: Discret. Comput. Geom. (2016)
Keyphrases
- upper bound
- convex hull
- minkowski sum
- lower bound
- convex polyhedra
- worst case
- lower and upper bounds
- knn
- generalization error
- minimum distance
- convex optimization
- distance transform
- error probability
- branch and bound
- random variables
- piecewise linear
- sample complexity
- mathematical morphology
- convex sets
- von neumann
- strictly convex
- bayesian networks
- extreme points
- risk minimization
- convex relaxation
- training samples