Pages that link to "Item:Q5291404"
From MaRDI portal
The following pages link to SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS (Q5291404):
Displaying 12 items.
- The class cover problem with boxes (Q419500) (← links)
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- Separability by two lines and by nearly straight polygonal chains (Q1885815) (← links)
- Separability of imprecise points (Q2362104) (← links)
- Dynamic minimum bichromatic separating circle (Q2424884) (← links)
- Separating bichromatic point sets in the plane by restricted orientation convex hulls (Q2694525) (← links)
- On the 2-Center Problem Under Convex Polyhedral Distance Function (Q2958331) (← links)
- ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS (Q3007722) (← links)
- PROCESSING AN OFFLINE INSERTION-QUERY SEQUENCE WITH APPLICATIONS (Q3173480) (← links)
- SEPARABILITY OF POINT SETS BY k-LEVEL LINEAR CLASSIFICATION TREES (Q4650094) (← links)
- Processing an Offline Insertion-Query Sequence with Applications (Q5321704) (← links)
- Separating Bichromatic Point Sets by Minimal Triangles with a Fixed Angle (Q5357503) (← links)
