The following pages link to Chris Schwiegelshohn (Q1755795):
Displaying 11 items.
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- Algorithms for fair \(k\)-clustering with multiple protected attributes (Q2060384) (← links)
- Fair coresets and streaming algorithms for fair \(k\)-means (Q2193095) (← links)
- Polynomial time approximation schemes for all 1-center problems on metric rational set similarities (Q2663710) (← links)
- BICO: BIRCH Meets Coresets for k-Means Clustering (Q2849339) (← links)
- Sublinear Estimation of Weighted Matchings in Dynamic Data Streams (Q3452791) (← links)
- (Q4598152) (← links)
- The Power of Migration for Online Slack Scheduling. (Q4606349) (← links)
- On Finding the Jaccard Center (Q5111353) (← links)
- Oblivious dimension reduction for <i>k</i> -means: beyond subspaces and the Johnson-Lindenstrauss lemma (Q5212844) (← links)
- Solving the Minimum String Cover Problem (Q5233719) (← links)
