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.
- Halfspace learning, linear programming, and nonmalicious distributions (Q1336756) (← links)
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements (Q1338464) (← links)
- Some best possible bounds concerning the traces of finite sets (Q1340130) (← links)
- A theory for memory-based learning (Q1342731) (← links)
- On the density of sets of divisors (Q1343798) (← links)
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension (Q1345876) (← links)
- On the convexified Sauer-Shelah theorem (Q1354724) (← links)
- Small forbidden configurations (Q1359370) (← links)
- A sufficient condition for polynomial distribution-dependent learnability (Q1364775) (← links)
- On the complexity of learning from drifting distributions (Q1376422) (← links)
- Sperner families of bounded VC-dimension (Q1377738) (← links)
- Guarding galleries where every point sees a large area (Q1380500) (← links)
- Counterexample to the Frankl-Pach conjecture for uniform, dense families (Q1382415) (← links)
- Well-known bound for the VC-dimension made easy (Q1386180) (← links)
- PAC-learning from general examples (Q1392015) (← links)
- Query complexity of membership comparable sets. (Q1401341) (← links)
- Which problems have strongly exponential complexity? (Q1604206) (← links)
- On the reducibility of sets inside NP to sets with low information content (Q1765294) (← links)
- Boosting the margin: a new explanation for the effectiveness of voting methods (Q1807156) (← links)
- Traces of antichains (Q1812791) (← links)
- Forbidden configurations, discrepancy and determinants (Q1813625) (← links)
- Quasi-optimal range searching in spaces of finite VC-dimension (Q1823698) (← links)
- On the trace of finite sets (Q1835917) (← links)
- Density and dimension (Q1836212) (← links)
- On the number of sets in a null t-design (Q1837690) (← links)
- Some remarks about embeddings of \(l_1^k\) in finite-dimensional spaces (Q1839408) (← links)
- General lower bounds on the query complexity within the exact learning model (Q1841883) (← links)
- PAC learning with nasty noise. (Q1853516) (← links)
- Generalization error of combined classifiers. (Q1872713) (← links)
- On the complexity of approximating the VC dimension. (Q1872731) (← links)
- Multicoloured extremal problems (Q1883144) (← links)
- A counterexample concerning uniform ergodic theorems for a class of functions (Q1897079) (← links)
- Forbidden configurations: Induction and linear algebra (Q1898049) (← links)
- A generalization of Sauer's lemma (Q1899068) (← links)
- On the complexity of function learning (Q1900975) (← links)
- Defect Sauer results (Q1903004) (← links)
- Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
- Improved upper bounds for probabilities of uniform deviations (Q1907891) (← links)
- Independence number and the complexity of families of sets (Q1918552) (← links)
- dp-rank and forbidden configurations (Q1934949) (← links)
- On membership comparable sets (Q1961377) (← links)
- Accuracy of techniques for the logical analysis of data (Q1961456) (← links)
- \(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration (Q1978498) (← links)
- Research on probabilistic methods for control system design (Q2276096) (← links)
- Model selection by bootstrap penalization for classification (Q2384135) (← links)
- A new PAC bound for intersection-closed concept classes (Q2384136) (← links)
- Independence in topological and \(C^*\)-dynamics (Q2384730) (← links)
- Quadratic boosting (Q2384982) (← links)
- Forbidding complete hypergraphs as traces (Q2478165) (← links)
- Aspects of discrete mathematics and probability in the theory of machine learning (Q2478432) (← links)