Volgen
Michael Kapralov
Michael Kapralov
Associate Professor, EPFL
Geverifieerd e-mailadres voor epfl.ch - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Random Fourier features for kernel ridge regression: Approximation bounds and statistical guarantees
H Avron, M Kapralov, C Musco, C Musco, A Velingker, A Zandieh
International conference on machine learning, 253-262, 2017
1822017
On the communication and streaming complexity of maximum bipartite matching
A Goel, M Kapralov, S Khanna
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete†…, 2012
1692012
Single pass spectral sparsification in dynamic streams
M Kapralov, YT Lee, CN Musco, CP Musco, A Sidford
SIAM Journal on Computing 46 (1), 456-477, 2017
1672017
Better bounds for matchings in the streaming model
M Kapralov
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete†…, 2013
1532013
On differentially private low rank approximation
M Kapralov, K Talwar
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete†…, 2013
1382013
Approximating matching size from random streams
M Kapralov, S Khanna, M Sudan
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete†…, 2014
1192014
Improved bounds for online stochastic matching
B Bahmani, M Kapralov
European Symposium on Algorithms, 170-181, 2010
1082010
Oblivious sketching of high-degree polynomial kernels
TD Ahle, M Kapralov, JBT Knudsen, R Pagh, A Velingker, DP Woodruff, ...
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete†…, 2020
1062020
Online submodular welfare maximization: Greedy is optimal
M Kapralov, I Post, J VondrŠk
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete†…, 2013
1012013
Perfect matchings in o(n log n) time in regular bipartite graphs
A Goel, M Kapralov, S Khanna
Proceedings of the Forty-second ACM Symposium on Theory of Computing, 39-46, 2010
952010
Practice of streaming processing of dynamic graphs: Concepts, models, and systems
M Besta, M Fischer, V Kalavri, M Kapralov, T Hoefler
IEEE Transactions on Parallel and Distributed Systems 34 (6), 1860-1876, 2021
852021
Sample-optimal Fourier sampling in any constant dimension
P Indyk, M Kapralov
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 514-523, 2014
812014
Spanners and sparsifiers in dynamic streams
M Kapralov, D Woodruff
Proceedings of the 2014 ACM symposium on Principles of distributed computing†…, 2014
792014
Online matching with general arrivals
B Gamlath, M Kapralov, A Maggiori, O Svensson, D Wajc
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 26-37, 2019
762019
A simple sublinear-time algorithm for counting arbitrary subgraphs via edge sampling
S Assadi, M Kapralov, S Khanna
arXiv preprint arXiv:1811.07780, 2018
712018
(Nearly) sample-optimal sparse Fourier transform
P Indyk, M Kapralov, E Price
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete†…, 2014
682014
Streaming lower bounds for approximating MAX-CUT
M Kapralov, S Khanna, M Sudan
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete†…, 2014
642014
Sparse Fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time
M Kapralov
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing†…, 2016
552016
Spectral sparsification via random spanners
M Kapralov, R Panigrahy
Proceedings of the 3rd Innovations in Theoretical Computer Science†…, 2012
522012
Factor modeling for advertisement targeting
Y Chen, M Kapralov, J Canny, D Pavlov
Advances in neural information processing systems 22, 2009
482009
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20