3 citations · 7 across the 4 of their papers we have counts for
11 papers
Sampling a Near Neighbor in High Dimensions -- Who is the Fairest of Them All?
Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi +2
Similarity search is a fundamental algorithmic primitive, widely used in many computer science disciplines. Given a set of points and a radius parameter , the -near nei…
Towards Better Approximation of Graph Crossing Number
Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan
Graph Crossing Number is a fundamental problem with various applications. In this problem, the goal is to draw an input graph in the plane so as to minimize the number of cross…
Streaming Complexity of SVMs
Alexandr Andoni, Collin Burns, Yi Li +2
We study the space complexity of solving the bias-regularized SVM problem in the streaming model. This is a classic supervised learning problem that has drawn lots of attention, in…
Non-Adaptive Adaptive Sampling on Turnstile Streams
Sepideh Mahabadi, Ilya Razenshteyn, David P. Woodruff +1
Adaptive sampling is a useful algorithmic tool for data summarization problems in the classical centralized setting, where the entire dataset is available to the single processor p…
Individual Fairness for -Clustering
Sepideh Mahabadi, Ali Vakilian
We give a local search based algorithm for -median and -means (and more generally for any -clustering with norm cost function) from the perspective of individual…
Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm
Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan +1
``Composable core-sets'' are an efficient framework for solving optimization problems in massive data models. In this work, we consider efficient construction of composable core-se…