Showing 1–20 of 33 results
/ Date/ Name
Dec 8, 2025Property Testing of Computational NetworksDec 5, 2017Approximating the Spectrum of a GraphDec 22, 2020Fast and Accurate $k$-means++ via Rejection SamplingSep 9, 2018Strong Coresets for k-Median and Subspace Approximation: Goodbye DimensionJan 14, 2021Spectral Clustering Oracles in Sublinear TimeMay 22, 2018On Coresets for Logistic RegressionApr 13, 2015Testing Cluster Structure of GraphsAug 7, 2019Fully dynamic hierarchical diameter k-clustering and k-centerDec 2, 2013Property-Testing in Sparse Directed Graphs: 3-Star-Freeness and ConnectivityDec 29, 2022Constant Approximation for Normalized Modularity and Associations ClusteringJul 12, 2018Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clusteringNov 7, 2018Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite SubpropertyDec 28, 2018Fair Coresets and Streaming Algorithms for Fair k-Means ClusteringJun 13, 2017Clustering High Dimensional Dynamic Data StreamsAug 8, 2014Asymptotically exact streaming algorithmsAug 9, 2025A near-linear time approximation scheme for $(k,\ell)$-median clustering under discrete Fréchet distanceFeb 13, 2026Learning to Approximate Uniform Facility Location via Graph Neural NetworksMar 25, 2026Near Linear Time Approximation Schemes for Clustering of Partially Doubling MetricsJul 23, 2010Finding Cycles and Trees in Sublinear TimeSep 23, 2019A characterization of graph properties testable for general planar graphs with one-sided error (It is all about forbidden subgraphs)