Balls in \(\mathbb{R}^k\) do not cut all subsets of \(k+2\) points
From MaRDI portal
Publication:1258306
DOI10.1016/0001-8708(79)90047-1zbMath0408.05001OpenAlexW163763094MaRDI QIDQ1258306
Publication date: 1979
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0001-8708(79)90047-1
Related Items
Is the \(k\)-NN classifier in high dimensions affected by the curse of dimensionality?, Empirical and multiplier bootstraps for suprema of empirical processes of increasing complexity, and related Gaussian couplings, VC dimensions of principal component analysis, Sample Compression Schemes for Balls in Graphs, Connecting deterministic and stochastic metapopulation models, Neural Networks with Local Receptive Fields and Superlinear VC Dimension, Some special Vapnik-Chervonenkis classes, Accuracy of approximations of solutions to Fredholm equations by kernel methods, Some new maximum VC classes, On intersecting a point set with Euclidean balls, Uniform convergence rates for halfspace depth, Theory of Classification: a Survey of Some Recent Advances, Quantifying the generalization error in deep learning in terms of data distribution and neural network smoothness, Density and dimension
Cites Work
