Články se zplnomocněním k veřejnému přístupu - Vahab MirrokniDalší informace
Dostupné někde: 39
Stochastic bandits robust to adversarial corruptions
T Lykouris, V Mirrokni, R Paes Leme
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
Zplnomocnění: US National Science Foundation
Affinity clustering: Hierarchical clustering at scale
MH Bateni, S Behnezhad, M Derakhshan, MT Hajiaghayi, R Kiveris, ...
Advances in Neural Information Processing Systems 30, 2017
Zplnomocnění: US National Science Foundation, US Department of Defense
Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs
S Assadi, MH Bateni, A Bernstein, V Mirrokni, C Stein
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
Zplnomocnění: US National Science Foundation
Uncoordinated two-sided matching markets
H Ackermann, PW Goldberg, VS Mirrokni, H Röglin, B Vöcking
Proceedings of the 9th ACM Conference on Electronic Commerce, 256-263, 2008
Zplnomocnění: German Research Foundation
Dynamic incentive-aware learning: Robust pricing in contextual auctions
N Golrezaei, A Javanmard, V Mirrokni
Advances in Neural Information Processing Systems 32, 2019
Zplnomocnění: US National Science Foundation
Submodular maximization with nearly optimal approximation, adaptivity and query complexity
M Fahrbach, V Mirrokni, M Zadimoghaddam
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
Zplnomocnění: US National Science Foundation
Regret bounds for batched bandits
H Esfandiari, A Karbasi, A Mehrabian, V Mirrokni
Proceedings of the AAAI Conference on Artificial Intelligence 35 (8), 7340-7348, 2021
Zplnomocnění: US National Science Foundation, US Department of Defense, Canada First …
Ego-net community mining applied to friend suggestion
A Epasto, S Lattanzi, V Mirrokni, IO Sebe, A Taei, S Verma
Proceedings of the VLDB Endowment 9 (4), 324-335, 2015
Zplnomocnění: Government of Italy
Consistent hashing with bounded loads
V Mirrokni, M Thorup, M Zadimoghaddam
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
Zplnomocnění: Danish Council for Independent Research
Competitive routing over time
M Hoefer, VS Mirrokni, H Röglin, SH Teng
Theoretical Computer Science 412 (39), 5420-5432, 2011
Zplnomocnění: German Research Foundation
Non-monotone submodular maximization with nearly optimal adaptivity and query complexity
M Fahrbach, V Mirrokni, M Zadimoghaddam
International Conference on Machine Learning, 1833-1842, 2019
Zplnomocnění: US National Science Foundation
Near-optimal massively parallel graph connectivity
S Behnezhad, L Dhulipala, H Esfandiari, J Lacki, V Mirrokni
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
Zplnomocnění: US National Science Foundation
Efficient algorithms for public-private social networks
F Chierichetti, A Epasto, R Kumar, S Lattanzi, V Mirrokni
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge …, 2015
Zplnomocnění: Government of Italy
Design and analysis of bipartite experiments under a linear exposure-response model
C Harshaw, F Sävje, D Eisenstat, V Mirrokni, J Pouget-Abadie
Electronic Journal of Statistics 17 (1), 464-518, 2023
Zplnomocnění: US National Science Foundation, US Department of Defense
Tight bounds for approximate Carathéodory and beyond
V Mirrokni, RP Leme, A Vladu, SC Wong
International Conference on Machine Learning, 2440-2448, 2017
Zplnomocnění: US National Science Foundation
The landscape of the proximal point method for nonconvex–nonconcave minimax optimization
B Grimmer, H Lu, P Worah, V Mirrokni
Mathematical Programming 201 (1), 373-407, 2023
Zplnomocnění: US National Science Foundation
Approximate leave-one-out for fast parameter tuning in high dimensions
S Wang, W Zhou, H Lu, A Maleki, V Mirrokni
International Conference on Machine Learning, 5228-5237, 2018
Zplnomocnění: US National Institutes of Health
Optimizing cluster-based randomized experiments under monotonicity
J Pouget-Abadie, V Mirrokni, DC Parkes, EM Airoldi
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge …, 2018
Zplnomocnění: US National Science Foundation, US Department of Defense
Parallelizing thompson sampling
A Karbasi, V Mirrokni, M Shadravan
Advances in Neural Information Processing Systems 34, 10535-10548, 2021
Zplnomocnění: US National Science Foundation, US Department of Defense
Batched neural bandits
Q Gu, A Karbasi, K Khosravi, V Mirrokni, D Zhou
ACM/JMS Journal of Data Science 1 (1), 1-18, 2024
Zplnomocnění: US National Science Foundation, US Department of Defense
Informace o publikování a financování jsou automaticky vybírány počítačovým programem