Pages that link to "Item:Q3581392"
From MaRDI portal
The following pages link to Coresets in dynamic geometric data streams (Q3581392):
Displaying 21 items.
- A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems (Q486976) (← links)
- An almost space-optimal streaming algorithm for coresets in fixed dimensions (Q547286) (← links)
- Dynamic coresets (Q834605) (← links)
- Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
- A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems (Q2124197) (← links)
- Probabilistic \(k\)-median clustering in data streams (Q2344214) (← links)
- Algorithms for k-median Clustering over Distributed Streams (Q2817895) (← links)
- Streaming Embeddings with Slack (Q3183478) (← links)
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
- Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620) (← links)
- Facility Location in Dynamic Geometric Data Streams (Q3541125) (← links)
- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions (Q3541136) (← links)
- (Q4558482) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- On Low-Risk Heavy Hitters and Sparse Recovery Schemes (Q5009511) (← links)
- (Q5009578) (← links)
- (Q5091191) (← links)
- (Q5743411) (← links)
- (Q5874528) (← links)
- (Q5875522) (← links)
- On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)
