Pages that link to "Item:Q1089803"
From MaRDI portal
The following pages link to \(\epsilon\)-nets and simplex range queries (Q1089803):
Displaying 50 items.
- System of unbiased representatives for a collection of bicolorings (Q2201776) (← links)
- Random sampling with removal (Q2207595) (← links)
- A Sauer-Shelah-Perles lemma for lattices (Q2209889) (← links)
- Random polytopes and the wet part for arbitrary probability distributions (Q2211500) (← links)
- On weak \(\epsilon\)-nets and the Radon number (Q2223615) (← links)
- Sublinear search spaces for shortest path planning in grid and road networks (Q2230730) (← links)
- Domain adaptation -- can quantity compensate for quality? (Q2248544) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- When are epsilon-nets small? (Q2304628) (← links)
- Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time (Q2309471) (← links)
- Multilevel polynomial partitions and simplified range searching (Q2354673) (← links)
- Fast segment insertion and incremental construction of constrained Delaunay triangulations (Q2354921) (← links)
- Convex hulls under uncertainty (Q2408916) (← links)
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams (Q2414862) (← links)
- A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model (Q2415377) (← links)
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension (Q2415381) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
- Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension (Q2479477) (← links)
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197) (← links)
- Approximate range searching using binary space partitions (Q2489539) (← links)
- Counting and representing intersections among triangles in three dimensions (Q2571213) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Triangles in space or building (and analyzing) castles in the air (Q2638823) (← links)
- An algorithm for generalized point location and its applications (Q2639635) (← links)
- The VC dimension of metric balls under Fréchet and Hausdorff distances (Q2665263) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Large area convex holes in random point sets (Q2821621) (← links)
- Subsampling in Smoothed Range Spaces (Q2835631) (← links)
- On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants (Q3174729) (← links)
- Core-Sets: Updated Survey (Q3297370) (← links)
- Spanning trees with low crossing number (Q3358265) (← links)
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces (Q3451756) (← links)
- Geometric Hitting Sets for Disks: Theory and Practice (Q3452850) (← links)
- Lower Bounds on the Complexity of Polytope Range Searching (Q3471697) (← links)
- A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks (Q3507337) (← links)
- SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS (Q3521590) (← links)
- On the VC-dimension and boolean functions with long runs (Q3637825) (← links)
- Small violations of Bell inequalities for multipartite pure random states (Q4565440) (← links)
- ON PARAMETERIZED COMPLEXITY OF HITTING SET PROBLEM FOR AXIS–PARALLEL SQUARES INSTERSECTING A STRAIGHT LINE (Q4581438) (← links)
- On the VC-Dimension of Binary Codes (Q4583427) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- One-Sided Epsilon-Approximants (Q4604378) (← links)
- Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems (Q4604388) (← links)
- Teaching and Compressing for Low VC-Dimension (Q4604393) (← links)
- Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
- Robust Tverberg and Colourful Carathéodory Results via Random Choice (Q4635512) (← links)
- On the number of points in general position in the plane (Q4645041) (← links)
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS (Q4682170) (← links)
- Family Complexity and VC-Dimension (Q4915244) (← links)
- Tight lower bounds for the size of epsilon-nets (Q4924064) (← links)
