Bichromatic separability with two boxes: A general approach
From MaRDI portal
Publication:3497513
Recommendations
Cited in
(18)- Hierarchical design of fast minimum disagreement algorithms
- Covering a bichromatic point set with two disjoint monochromatic disks
- Variations of largest rectangle recognition amidst a bichromatic point set
- Separability of imprecise points
- Dynamic minimum bichromatic separating circle
- Maximum-weight planar boxes in \(O(n^2)\) time (and better)
- Separating bichromatic point sets in the plane by restricted orientation convex hulls
- Placing two axis-parallel squares to maximize the number of enclosed points
- Hierarchical design of fast minimum disagreement algorithms
- Polynomial time algorithms for bichromatic problems
- Dynamic minimum bichromatic separating circle
- The maximum box problem for moving points in the plane
- Minimizing the error of linear separators on linearly inseparable data
- Computing the coarseness with strips or boxes
- scientific article; zbMATH DE number 6469209 (Why is no real title available?)
- Diagrammatic Representation and Inference
- Maximum box problem on stochastic points
- Computing the coarseness measure of a bicolored point set over guillotine partitions
This page was built for publication: Bichromatic separability with two boxes: A general approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3497513)