Hyperplane separability and convexity of probabilistic point sets
From MaRDI portal
(Redirected from Publication:3132872)
Hyperplane separability and convexity of probabilistic point sets (scientific article; zbMATH DE number 6832295)
Hyperplane separability and convexity of probabilistic point sets (scientific article; zbMATH DE number 6832295)
Recommendations
Cited in
(14)- Euclidean minimum spanning trees with independent and dependent geometric uncertainties
- On the separability of stochastic geometric objects, with applications
- Support vector machines and Radon's theorem
- Separation of integer points by a hyperplane under some weak notions of discrete convexity
- Computing the Expected Value and Variance of Geometric Measures
- Active-learning a convex body in low dimensions
- Hyperplane separability and convexity of probabilistic point sets
- On the separability of stochastic geometric objects, with applications
- Monotonicity of Linear Separability Under Translation
- Separability and Tight Enclosure of Point Sets
- Algorithms and Computation
- Deep learning generalization and the convex hull of training sets
- Half-plane point retrieval queries with independent and dependent geometric uncertainties
- Separability of imprecise points
This page was built for publication: Hyperplane separability and convexity of probabilistic point sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132872)