The following pages link to (Q3174151):
Displaying 17 items.
- Algebraic methods proving Sauer's bound for teaching complexity (Q465250) (← links)
- Vapnik-Chervonenkis density on indiscernible sequences, stability, and the maximum property (Q894257) (← links)
- Learning the set covering machine by bound minimization and margin-sparsity trade-off (Q1959549) (← links)
- Unlabeled sample compression schemes and corner peelings for ample and maximum classes (Q2121466) (← links)
- On partial cubes, well-graded families and their duals with some applications in graphs (Q2192079) (← links)
- Shattering-extremal set systems from Sperner families (Q2309556) (← links)
- On density of subgraphs of halved cubes (Q2311351) (← links)
- Some new maximum VC classes (Q2446573) (← links)
- Shifting: one-inclusion mistake bounds and sample compression (Q2517823) (← links)
- Bounding Embeddings of VC Classes into Maximum Classes (Q2805735) (← links)
- Labeled Compression Schemes for Extremal Classes (Q2830265) (← links)
- On Version Space Compression (Q2830266) (← links)
- Teaching and Compressing for Low VC-Dimension (Q4604393) (← links)
- Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
- (Q5091184) (← links)
- Order compression schemes (Q5964067) (← links)
- Labeled sample compression schemes for complexes of oriented matroids (Q6564616) (← links)
