Pages that link to "Item:Q1089803"
From MaRDI portal
The following pages link to \(\epsilon\)-nets and simplex range queries (Q1089803):
Displaying 50 items.
- An optimal extension of the centerpoint theorem (Q924064) (← links)
- Minimizing interference of a wireless ad-hoc network in a plane (Q936528) (← links)
- Constrained versions of Sauer's Lemma (Q948694) (← links)
- Compression schemes, stable definable families, and o-minimal structures (Q972602) (← links)
- Reprint of: Weak \(\varepsilon\)-nets have basis of size \(O(1/{\epsilon}\log (1/\epsilon))\) in any dimension (Q982945) (← links)
- \(k\)-Fold unions of low-dimensional concept classes (Q990081) (← links)
- Random constructions and density results (Q1009013) (← links)
- Coloring geometric range spaces (Q1017922) (← links)
- Small weak epsilon-nets (Q1025302) (← links)
- New results on lower bounds for the number of \((\leq k)\)-facets (Q1039428) (← links)
- Hitting sets when the VC-dimension is small (Q1041786) (← links)
- On the transversal number and VC-dimension of families of positive homothets of a convex body (Q1045145) (← links)
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework (Q1106669) (← links)
- Cutting hyperplane arrangements (Q1176317) (← links)
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications (Q1177933) (← links)
- On disjoint concave chains in arrangements of (pseudo) lines (Q1183468) (← links)
- Equivalence of models for polynomial learnability (Q1183606) (← links)
- Almost tight bounds for \(\epsilon\)-nets (Q1184160) (← links)
- Optimal randomized parallel algorithms for computational geometry (Q1187202) (← links)
- Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom (Q1194309) (← links)
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions (Q1194310) (← links)
- Reporting points in halfspaces (Q1196295) (← links)
- Intersection queries in sets of disks (Q1196457) (← links)
- Decision theoretic generalizations of the PAC model for neural net and other learning applications (Q1198550) (← links)
- Efficient partition trees (Q1199132) (← links)
- Dynamic point location in arrangements of hyperplanes (Q1199133) (← links)
- Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
- Bounding sample size with the Vapnik-Chervonenkis dimension (Q1209149) (← links)
- Cutting hyperplanes for divide-and-conquer (Q1209837) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- Guarding galleries where no point sees a small area. (Q1279960) (← links)
- Combinatorics and connectionism (Q1313821) (← links)
- Discrepancy and approximations for bounded VC-dimension (Q1316651) (← links)
- Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements (Q1317487) (← links)
- On sparse approximations to randomized strategies and convex combinations (Q1322876) (← links)
- Bounding the vertex cover number of a hypergraph (Q1323476) (← links)
- Testing geometric objects (Q1328754) (← links)
- On range searching with semialgebraic sets (Q1329188) (← links)
- Point location among hyperplanes and unidirectional ray-shooting (Q1330461) (← links)
- Efficient ray shooting and hidden surface removal (Q1330784) (← links)
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements (Q1338464) (← links)
- Almost tight upper bounds for lower envelopes in higher dimensions (Q1338960) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension (Q1345876) (← links)
- Inclusion-exclusion complexes for pseudodisk collections (Q1355193) (← links)
- The VC-dimension of set systems defined by graphs (Q1364472) (← links)
- Optimal, output-sensitive algorithms for constructing planar hulls in parallel (Q1367171) (← links)
- Guarding galleries where every point sees a large area (Q1380500) (← links)
- Approximate testing and its relationship to learning (Q1389650) (← links)
- Guarding scenes against invasive hypercubes. (Q1405005) (← links)
