Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces.
Peter GritzmannVictor KleePublished in: Math. Program. (1993)
Keyphrases
- finite dimensional
- computational complexity
- vector space
- infinite dimensional
- higher dimensional
- convex sets
- convex hull
- euclidean space
- special case
- numerical solution
- reproducing kernel hilbert space
- distance measure
- low dimensional
- computationally efficient
- finite element
- metric space
- machine learning
- feature selection
- image segmentation
- shortest path
- semi supervised