Pages that link to "Item:Q3419620"
From MaRDI portal
The following pages link to Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620):
Displaying 17 items.
- Optimal time bounds for approximate clustering (Q703075) (← links)
- An update algorithm for restricted random walk clustering for dynamic data sets (Q734522) (← links)
- Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
- A sublinear-time approximation scheme for bin packing (Q1034628) (← links)
- On parameterized approximation algorithms for balanced clustering (Q2111529) (← links)
- On random perfect matchings in metric spaces with not-too-large diameters (Q2158300) (← links)
- On the properties of reachability, observability, controllability, and constructibility of discrete-time positive time-invariant linear systems with aperiodic choice of the sampling instants (Q2478387) (← links)
- Sublinear time approximate clustering (Q2768331) (← links)
- Submodular Approximation: Sampling-based Algorithms and Lower Bounds (Q3225170) (← links)
- A FAST k-MEANS IMPLEMENTATION USING CORESETS (Q3604141) (← links)
- (Q4558482) (← links)
- Learning Theory (Q4680894) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- Selective sampling for approximate clustering of very large data sets (Q5450361) (← links)
- Automata, Languages and Programming (Q5466479) (← links)
- Deterministic metric 1-median selection with very few queries (Q6590087) (← links)
- Coresets for kernel clustering (Q6613883) (← links)