scientific article; zbMATH DE number 7559251
From MaRDI portal
Publication:5088983
DOI10.4230/LIPIcs.SoCG.2019.51MaRDI QIDQ5088983
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
VC dimensionabstract convexityRadon numberKneser graphsHaussler packing lemmaweak \(\varepsilon\) nets
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space
- Lower bounds for weak epsilon-nets and stair-convexity
- A non-linear lower bound for planar epsilon-nets
- Kneser's conjecture, chromatic number, and homotopy
- Über eine Variante zum Hellyschen Satz
- \(\epsilon\)-nets and simplex range queries
- Some special Vapnik-Chervonenkis classes
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Separation of two convex sets in convexity structures
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- A lower bound for weak \(\varepsilon\)-nets in high dimension
- Transversal numbers for hypergraphs arising in geometry
- Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers
- On the number of halving planes
- Maximal convex sets
- The structure of semispaces
- On Components in Some Families of Sets
- Weak ε-nets and interval chains
- Learnability and the Vapnik-Chervonenkis dimension
- On the Geometry and Computational Complexity of Radon Partitions in the Iinteger Lattice
- Point Selections and Weak ε-Nets for Convex Hulls
- Improved bounds on weak ε-nets for convex sets
- Understanding Machine Learning
- Families of Non-disjoint subsets
This page was built for publication:
