Pages that link to "Item:Q2556406"
From MaRDI portal
The following pages link to On the density of families of sets (Q2556406):
Displayed 50 items.
- On intersecting a point set with Euclidean balls (Q676066) (← links)
- The Glivenko-Cantelli problem, ten years later (Q678082) (← links)
- A deterministic view of random sampling and its use in geometry (Q751816) (← links)
- On disjointly representable sets (Q790112) (← links)
- Embedding of \(\ell^ k_{\infty}\) in finite dimensional Banach spaces (Q797790) (← links)
- An extremal problem for Graham-Rothschild parameter words (Q803178) (← links)
- On families in finite lattices (Q810551) (← links)
- Pairwise intersections and forbidden configurations (Q850074) (← links)
- Spaces of operators, the \(\psi\)-Daugavet property, and numerical indices (Q850588) (← links)
- On the VC-dimension of uniform hypergraphs (Q857750) (← links)
- Covering numbers, Vapnik-Červonenkis classes and bounds for the star-discrepancy (Q876814) (← links)
- Constrained versions of Sauer's Lemma (Q948694) (← links)
- On the learnability of majority rule (Q996375) (← links)
- Active sampling for multiple output identification (Q1009223) (← links)
- Combinatorial lemmas and applications to dynamics (Q1011403) (← links)
- Combinatorial independence in measurable dynamics (Q1011429) (← links)
- \(l\)-trace \(k\)-Sperner families of sets (Q1024991) (← links)
- On the density of sets of vectors (Q1050983) (← links)
- Matrices with forbidden subconfigurations (Q1059636) (← links)
- Hypergraphs without a large star (Q1061141) (← links)
- General forbidden configuration theorems (Q1089344) (← links)
- \(\epsilon\)-nets and simplex range queries (Q1089803) (← links)
- Donsker classes of sets (Q1093240) (← links)
- Invertibility of ``large'' submatrices with applications to the geometry of Banach spaces and harmonic analysis (Q1094628) (← links)
- Short cocircuits in binary matroids (Q1101114) (← links)
- Forbidden submatrices (Q1103620) (← links)
- The Banach-Mazur distance to the cube and the Dvoretzky-Rogers factorization (Q1108537) (← links)
- Bounding one-way differences (Q1114687) (← links)
- A forbidden configuration theorem of Alon (Q1119580) (← links)
- ``Dart calculus'' of induced subsets (Q1159668) (← links)
- Equivalence of models for polynomial learnability (Q1183606) (← links)
- Almost tight bounds for \(\epsilon\)-nets (Q1184160) (← links)
- Type, infratype and the Elton-Pajor theorem (Q1187477) (← links)
- Decision theoretic generalizations of the PAC model for neural net and other learning applications (Q1198550) (← links)
- Trade-offs between communication and space (Q1201877) (← links)
- Existence of submatrices with all possible columns (Q1244221) (← links)
- Coordinate density of sets of vectors (Q1255001) (← links)
- Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes (Q1265741) (← links)
- A graph-theoretic generalization of the Sauer-Shelah lemma (Q1265742) (← links)
- Scale-sensitive dimensions and skeleton estimates for classification (Q1265744) (← links)
- General bounds on statistical query learning and PAC learning with noise via hypothesis boosting (Q1271468) (← links)
- Sample size lower bounds in PAC learning by Algorithmic Complexity Theory (Q1274920) (← links)
- Selecting a proportion of characters (Q1282273) (← links)
- Separable partitions (Q1283783) (← links)
- The VC-dimension of Sperner systems (Q1296751) (← links)
- Combinatorics and connectionism (Q1313821) (← links)
- A result of Vapnik with applications (Q1314333) (← links)
- Discrepancy and approximations for bounded VC-dimension (Q1316651) (← links)
- Density results for uniform families (Q1323482) (← links)
- A review of combinatorial problems arising in feedforward neural network design (Q1331904) (← links)