32 citations · 35 across the 2 of their papers we have counts for
2 papers
cs.LG2019★ 32 cited
Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity
Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam +2
Streaming algorithms are generally judged by the quality of their solution, memory footprint, and computational complexity. In this paper, we study the problem of maximizing a mono…
cs.LG2017★ 3 cited
Deletion-Robust Submodular Maximization at Scale
Ehsan Kazemi, Morteza Zadimoghaddam, Amin Karbasi
Can we efficiently extract useful information from a large user-generated dataset while protecting the privacy of the users and/or ensuring fairness in representation. We cast this…