Sepideh Mahabadi
Sepideh Mahabadi
Email verificata su ttic.edu - Home page
Titolo
Citata da
Citata da
Anno
Composable core-sets for diversity and coverage maximization
P Indyk, S Mahabadi, M Mahdian, VS Mirrokni
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of …, 2014
802014
Real-time recommendation of diverse related articles
S Abbar, S Amer-Yahia, P Indyk, S Mahabadi
Proceedings of the 22nd international conference on World Wide Web, 1-12, 2013
642013
On streaming and communication complexity of the set cover problem
ED Demaine, P Indyk, S Mahabadi, A Vakilian
International Symposium on Distributed Computing, 484-498, 2014
322014
Towards tight bounds for the streaming set cover problem
S Har-Peled, P Indyk, S Mahabadi, A Vakilian
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2016
28*2016
Diverse near neighbor problem
S Abbar, S Amer-Yahia, P Indyk, S Mahabadi, KR Varadarajan
Proceedings of the twenty-ninth annual symposium on Computational geometry …, 2013
232013
Fractional set cover in the streaming model
P Indyk, S Mahabadi, R Rubinfeld, J Ullman, A Vakilian, A Yodpinyanee
20th International Workshop on Approximation Algorithms for Combinatorial …, 2017
92017
Approximate nearest line search in high dimensions
S Mahabadi
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2015
92015
Nonlinear dimension reduction via outer Bi-Lipschitz extensions
S Mahabadi, K Makarychev, Y Makarychev, I Razenshteyn
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
82018
Proximity in the age of distraction: Robust approximate nearest neighbor search
S Har-Peled, S Mahabadi
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
62017
Composable core-sets for determinant maximization problems via spectral spanners
P Indyk, S Mahabadi, SO Gharan, A Rezaei
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
52020
Set Cover in Sub-linear Time
P Indyk, S Mahabadi, R Rubinfeld, A Vakilian, A Yodpinyanee
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
42018
Near Neighbor: Who is the Fairest of Them All?
S Har-Peled, S Mahabadi
Advances in Neural Information Processing Systems, 13176-13187, 2019
32019
Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm
P Indyk, S Mahabadi, SO Gharan, A Rezaei
International Conference on Machine Learning, 4254-4263, 2019
22019
Approximate Sparse Linear Regression
S Har-Peled, P Indyk, S Mahabadi
arXiv preprint arXiv:1609.08739, 2016
22016
Simultaneous Nearest Neighbor Search
P Indyk, R Kleinberg, S Mahabadi, Y Yuan
arXiv preprint arXiv:1604.02188, 2016
12016
An Algorithm for Construction of All Perfect Phylogeny Matrices
H Mirzaei, S Ahmadian, S Mahabadi, M Sadeghi, C Eslahchi, H Pezeshk
Match 62 (2), 251, 2009
12009
Non-adaptive adaptive sampling on turnstile streams
S Mahabadi, I Razenshteyn, DP Woodruff, S Zhou
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
2020
(Individual) Fairness for -Clustering
S Mahabadi, A Vakilian
arXiv preprint arXiv:2002.06742, 2020
2020
LSH on the Hypercube Revisited
S Har-Peled, S Mahabadi
arXiv preprint arXiv:1704.02546, 2017
2017
Sublinear algorithms for massive data problems
S Mahabadi
Massachusetts Institute of Technology, 2017
2017
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20