Subsampling in Smoothed Range Spaces

DOI10.1007/978-3-319-24486-0_15zbMath1471.68224arXiv1510.09123OpenAlexW2962728542MaRDI QIDQ2835631

Jeff M. Phillips, Yan Zheng

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.09123

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• \(\epsilon\)-nets and simplex range queries
• Irregularities of distribution. I
• Tight upper bounds for the discrepancy of half-spaces
• Algorithms for ε-Approximations of Terrains
• New existence proofs ε-nets
• On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
• Scale-sensitive dimensions, uniform convergence, and learnability
• Tight lower bounds for the size of epsilon-nets
• Paths, Trees, and Flowers
• Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
• Comparing distributions and shapes using the kernel distance
• On Range Searching in the Group Model and Combinatorial Discrepancy
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Concentration of Measure for the Analysis of Randomized Algorithms
• Geometric discrepancy. An illustrated guide
• Improved bounds on the sample complexity of learning

This page was built for publication: Subsampling in Smoothed Range Spaces