Computing approximate statistical discrepancy
From MaRDI portal
(Redirected from Computing approximate statistical discrepancy)
Recommendations
- Discrepancy and approximations for bounded VC-dimension
- Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
- Optimal private halfspace counting via discrepancy
- Practical low-dimensional halfspace range space sampling
- Distribution-sensitive bounds on relative approximations of geometric ranges
Cites work
- A spatial scan statistic
- A Spatial Scan Statistic for Survival Data
- Applied computational geometry. Towards geometric engineering. FCRC '96 workshop, WACG '96, Philadelphia, PA, USA, May 27--28, 1996. Selected papers
- Efficient algorithms for the maximum subarray problem by distance matrix multiplication
- Geometric discrepancy. An illustrated guide
- scientific article; zbMATH DE number 1528185 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- Improved bounds on the sample complexity of learning
- Maximum-weight planar boxes in \(O(n^2)\) time (and better)
- On the density of families of sets
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Optimal and fast detection of spatial clusters with scan statistics
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- The hunting of the bump
Cited in
(2)
This page was built for publication: Computing approximate statistical discrepancy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091023)
