Pages that link to "Item:Q3069903"
From MaRDI portal
The following pages link to Approximating extent measures of points (Q3069903):
Displaying 50 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions (Q390131) (← links)
- Streaming with minimum space: an algorithm for covering by two congruent balls (Q393049) (← links)
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- Out-of-order event processing in kinetic data structures (Q534768) (← links)
- An almost space-optimal streaming algorithm for coresets in fixed dimensions (Q547286) (← links)
- Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points (Q680145) (← links)
- On the minimum-area rectangular and square annulus problem (Q827319) (← links)
- An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width (Q833568) (← links)
- Dynamic coresets (Q834605) (← links)
- How to get close to the median shape (Q870425) (← links)
- Kinetic facility location (Q970606) (← links)
- Practical methods for shape fitting and kinetic data structures using coresets (Q1006384) (← links)
- Single facility collection depots location problem in the plane (Q1025297) (← links)
- Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric (Q1037776) (← links)
- On the combinatorial complexity of approximating polytopes (Q1688856) (← links)
- Computing a minimum-width square annulus in arbitrary orientation (Q1705772) (← links)
- Approximation algorithms for color spanning diameter (Q1708269) (← links)
- Optimal consensus set for digital flake hyperspheres in \(n\)D (Q1747509) (← links)
- A linear time approximation scheme for computing geometric maximum \(k\)-star (Q1942028) (← links)
- On the \(k\)-colored rainbow sets in fixed dimensions (Q2150582) (← links)
- Tree drawings revisited (Q2189731) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Parameterized \(k\)-clustering: tractability island (Q2221803) (← links)
- Window queries for intersecting objects, maximal points and approximations using coresets (Q2235286) (← links)
- Approximating a planar convex set using a sparse grid (Q2274483) (← links)
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points (Q2304571) (← links)
- Probabilistic \(k\)-median clustering in data streams (Q2344214) (← links)
- Streaming algorithms for extent problems in high dimensions (Q2345940) (← links)
- Aligning two convex figures to minimize area or perimeter (Q2428667) (← links)
- Adaptive sampling for geometric problems over data streams (Q2477195) (← links)
- Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets (Q2489540) (← links)
- Learning big (image) data via coresets for dictionaries (Q2513397) (← links)
- Extremal point queries with lines and line segments and related problems (Q2571215) (← links)
- Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy (Q2796207) (← links)
- Computing a Minimum-Width Square Annulus in Arbitrary Orientation (Q2803818) (← links)
- COMPUTING <i>k</i> CENTERS OVER STREAMING DATA FOR SMALL <i>k</i> (Q2939917) (← links)
- Core-Sets: Updated Survey (Q3297370) (← links)
- A Family of Unsupervised Sampling Algorithms (Q3297372) (← links)
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
- Simplified Planar Coresets for Data Streams (Q3512444) (← links)
- SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS (Q3521590) (← links)
- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions (Q3541136) (← links)
- A FAST k-MEANS IMPLEMENTATION USING CORESETS (Q3604141) (← links)
- Approximate Polytope Membership Queries (Q4600697) (← links)
- A Streaming Algorithm for k-Means with Approximate Coreset (Q4631688) (← links)
- Sparse Approximation via Generating Point Sets (Q4972677) (← links)
- Approximate Convex Hull of Data Streams (Q5002691) (← links)
- Parameterized Low-Rank Binary Matrix Approximation (Q5002728) (← links)
- (Q5009560) (← links)