The following pages link to (Q5381136):
Displaying 9 items.
- Hitting sets when the VC-dimension is small (Q1041786) (← links)
- The VC-dimension of set systems defined by graphs (Q1364472) (← links)
- An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets (Q2206734) (← links)
- The VC-dimension of K-vertex D-polytopes (Q2663418) (← links)
- The VC dimension of metric balls under Fréchet and Hausdorff distances (Q2665263) (← links)
- (Q4225320) (← links)
- (Q5088958) (← links)
- Neural network approximation (Q5887830) (← links)
- Boosting simple learners (Q6566593) (← links)