61 citations · 114 across the 21 of their papers we have counts for
15 papers · 1 filter
High-Dimensional Geometric Streaming for Nearly Low Rank Data
Hossein Esfandiari, Vahab Mirrokni, Praneeth Kacham +2
We study streaming algorithms for the subspace approximation problem. Given points as an insertion-only stream and a rank parameter , the su…
Optimal Communication for Classic Functions in the Coordinator Model and Beyond
Hossein Esfandiari, Praneeth Kacham, Vahab Mirrokni +2
In the coordinator model of communication with servers, given an arbitrary non-negative function , we study the problem of approximating the sum up…
Optimal Fully Dynamic -Center Clustering for Adaptive and Oblivious Adversaries
MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger +4
In fully dynamic clustering problems, a clustering of a given data set in a metric space must be maintained while it is modified through insertions and deletions of individual poin…
Improved Approximations for Euclidean -means and -median, via Nested Quasi-Independent Sets
Vincent Cohen-Addad, Hossein Esfandiari, Vahab Mirrokni +1
Motivated by data analysis and machine learning applications, we consider the popular high-dimensional Euclidean -median and -means problems. We propose a new primal-dual alg…
Prophets, Secretaries, and Maximizing the Probability of Choosing the Best
Hossein Esfandiari, MohammadTaghi HajiAghayi, Brendan Lucier +1
Suppose a customer is faced with a sequence of fluctuating prices, such as for airfare or a product sold by a large online retailer. Given distributional information about what pri…
Streaming Balanced Clustering
Hossein Esfandiari, Vahab Mirrokni, Peilin Zhong
Clustering of data points in metric space is among the most fundamental problems in computer science with plenty of applications in data mining, information retrieval and machine l…