I agree that this site is using cookies. You can find further informations here.
X
Mahabadi, Sepideh
65  results:
Search for persons X
?
1

Sampling a Near Neighbor in High Dimensions — Who is the Fa..:

Aumüller, Martin ; Har-Peled, Sariel ; Mahabadi, Sepideh..
ACM Transactions on Database Systems.  47 (2022)  1 - p. 1-40 , 2022
Link: https://doi.org/10.1145/..
 
?
2

Sampling near neighbors in search for fairness:

Aumüller, Martin ; Har-Peled, Sariel ; Mahabadi, Sepideh..
Communications of the ACM.  65 (2022)  8 - p. 83-90 , 2022
Link: https://doi.org/10.1145/..
 
?
3

Fair near neighbor search via sampling:

Aumuller, Martin ; Har-Peled, Sariel ; Mahabadi, Sepideh..
ACM SIGMOD Record.  50 (2021)  1 - p. 42-49 , 2021
Link: https://dl.acm.org/doi/1..
 
?
4

Fair near neighbor search via sampling:

Aumuller, Martin ; Har-Peled, Sariel ; Mahabadi, Sepideh..
ACM SIGMOD Record.  50 (2021)  1 - p. 42-49 , 2021
Link: https://doi.org/10.1145/..
 
?
5

Composable core-sets for determinant maximization problems ..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Indyk, Piotr ; Mahabadi, Sepideh ; Gharan, Shayan Oveis. - p. 1675-1694 , 2020
Link: https://dl.acm.org/doi/1..
 
?
6

Towards Better Approximation of Graph Crossing Number:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Chuzhoy, Julia ; Mahabadi, Sepideh ; Tan, Zihan - p. 73-84 , 2020
Link: https://doi.org/10.1109/..
 
?
7

Non-adaptive adaptive sampling on turnstile streams:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Mahabadi, Sepideh ; Razenshteyn, Ilya ; Woodruff, David P.. - p. 1251-1264 , 2020
Link: https://dl.acm.org/doi/1..
 
?
8

Nonlinear dimension reduction via outer Bi-Lipschitz extens..:

, In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing,
Mahabadi, Sepideh ; Makarychev, Konstantin ; Makarychev, Yury. - p. 1088-1101 , 2018
Link: https://dl.acm.org/doi/1..
 
?
9

Set Cover in Sub-linear Time:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Indyk, Piotr ; Mahabadi, Sepideh ; Rubinfeld, Ronitt.. - p. 2467-2486 , 2018
Link: https://doi.org/10.1137/..
 
?
10

Set cover in sub-linear time:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Indyk, Piotr ; Mahabadi, Sepideh ; Rubinfeld, Ronitt.. - p. 2467-2486 , 2018
Link: https://dl.acm.org/doi/1..
 
?
11

Proximity in the age of distraction : robust approximate..:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,
Har-Peled, Sariel ; Mahabadi, Sepideh - p. 1-15 , 2017
Link: https://dl.acm.org/doi/1..
 
?
12

Towards Tight Bounds for the Streaming Set Cover Problem:

, In: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,
Har-Peled, Sariel ; Indyk, Piotr ; Mahabadi, Sepideh. - p. 371-383 , 2016
Link: https://dl.acm.org/doi/1..
 
?
13

Approximate nearest line search in high dimensions:

, In: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms,
Mahabadi, Sepideh - p. 337-354 , 2015
Link: https://dl.acm.org/doi/1..
 
?
14

Composable core-sets for diversity and coverage maximizatio:

, In: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems,
Indyk, Piotr ; Mahabadi, Sepideh ; Mahdian, Mohammad. - p. 100-108 , 2014
Link: https://dl.acm.org/doi/1..
 
?
15

Diverse near neighbor problem:

, In: Proceedings of the twenty-ninth annual symposium on Computational geometry,
Abbar, Sofiane ; Amer-Yahia, Sihem ; Indyk, Piotr.. - p. 207-214 , 2013
Link: https://dl.acm.org/doi/1..
 
1-15