Pages that link to "Item:Q686422"
From MaRDI portal
The following pages link to Algorithms for weak and wide separation of sets (Q686422):
Displaying 5 items.
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- Lower bounds for the number of hyperplanes separating two finite sets of points (Q492284) (← links)
- Separability by two lines and by nearly straight polygonal chains (Q1885815) (← links)
- Separability of imprecise points (Q2362104) (← links)
- Separating bichromatic point sets in the plane by restricted orientation convex hulls (Q2694525) (← links)
