An upper bound on the shortness exponent of inscribable polytopes.
Michael B. DillencourtPublished in: J. Comb. Theory, Ser. B (1989)
Keyphrases
- upper bound
- lower bound
- worst case
- upper and lower bounds
- lattice points
- power law
- generalization error
- branch and bound
- convex hull
- lower and upper bounds
- branch and bound algorithm
- error probability
- high quality
- feature vectors
- three dimensional
- neural network
- feature selection
- image processing
- computer vision
- packing problem
- computational complexity
- image sequences