受强制性开放获取政策约束的文章 - Sepideh Mahabadi了解详情
可在其他位置公开访问的文章：17 篇
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
强制性开放获取政策： US National Science Foundation, Danish National Research Foundation
On streaming and communication complexity of the set cover problem
ED Demaine, P Indyk, S Mahabadi, A Vakilian
Distributed Computing: 28th International Symposium, DISC 2014, Austin, TX …, 2014
强制性开放获取政策： Danish National Research Foundation
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
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： US National Science Foundation, US Department of Defense
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
强制性开放获取政策： US National Science Foundation
Fair near neighbor search via sampling
M Aumuller, S Har-Peled, S Mahabadi, R Pagh, F Silvestri
ACM SIGMOD Record 50 (1), 42-49, 2021
强制性开放获取政策： US National Science Foundation, Villum Foundation, Government of Italy
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
强制性开放获取政策： US National Science Foundation, US Department of Defense
Sampling a Near Neighbor in High Dimensions—Who is the Fairest of Them All?
M Aumüller, S Har-Peled, S Mahabadi, R Pagh, F Silvestri
ACM Transactions on Database Systems (TODS) 47 (1), 1-40, 2022
强制性开放获取政策： US National Science Foundation, Government of Italy
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
强制性开放获取政策： US National Science Foundation
Towards Better Approximation of Graph Crossing Number
J Chuzhoy, S Mahabadi, Z Tan
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 73-84, 2020
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： US National Science Foundation
Tight Bounds for Volumetric Spanners and Applications
A Bhaskara, S Mahabadi, A Vakilian
Thirty-seventh Conference on Neural Information Processing Systems 36, 2023
强制性开放获取政策： US National Science Foundation
Differentially Private Approximate Near Neighbor Counting in High Dimensions
A Andoni, P Indyk, S Mahabadi, S Narayanan
Thirty-seventh Conference on Neural Information Processing Systems, 2023
强制性开放获取政策： US National Science Foundation, US Department of Defense
Sampling near neighbors in search for fairness
M Aumüller, S Har-Peled, S Mahabadi, R Pagh, F Silvestri
Communications of the ACM 65 (8), 83-90, 2022
强制性开放获取政策： US National Science Foundation, Villum Foundation, Government of Italy
Simultaneous Nearest Neighbor Search
P Indyk, R Kleinberg, S Mahabadi, Y Yuan
arXiv preprint arXiv:1604.02188, 2016
强制性开放获取政策： US National Science Foundation
Two-Sided Kirszbraun Theorem
A Backurs, S Mahabadi, K Makarychev, Y Makarychev
37th International Symposium on Computational Geometry (SoCG 2021), 2021
强制性开放获取政策： US National Science Foundation
出版信息和资助信息由计算机程序自动确定