Pages that link to "Item:Q3497513"
From MaRDI portal
The following pages link to Bichromatic separability with two boxes: A general approach (Q3497513):
Displaying 17 items.
- The maximum box problem for moving points in the plane (Q411213) (← links)
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- Computing the coarseness with strips or boxes (Q526818) (← links)
- Hierarchical design of fast minimum disagreement algorithms (Q1704562) (← links)
- Covering a bichromatic point set with two disjoint monochromatic disks (Q1931262) (← links)
- Variations of largest rectangle recognition amidst a bichromatic point set (Q2201768) (← links)
- Separability of imprecise points (Q2362104) (← links)
- Dynamic minimum bichromatic separating circle (Q2424884) (← links)
- Maximum-weight planar boxes in \(O(n^2)\) time (and better) (Q2448119) (← links)
- Separating bichromatic point sets in the plane by restricted orientation convex hulls (Q2694525) (← links)
- Placing two axis-parallel squares to maximize the number of enclosed points (Q2792797) (← links)
- Hierarchical Design of Fast Minimum Disagreement Algorithms (Q2835623) (← links)
- Polynomial Time Algorithms for Bichromatic Problems (Q2971630) (← links)
- (Q5501327) (← links)
- Diagrammatic Representation and Inference (Q5714081) (← links)
- Maximum box problem on stochastic points (Q5918465) (← links)
- Computing the coarseness measure of a bicolored point set over guillotine partitions (Q6657381) (← links)