Kamu erişimi zorunlu olan makaleler - Qian Yu (于乾)Daha fazla bilgi edinin
Hiçbir yerde sunulmuyor: 1
Coded computing for resilient, secure, and privacy-preserving distributed matrix multiplication
Q Yu, AS Avestimehr
IEEE Transactions on Communications 69 (1), 59-72, 2020
Zorunlu olanlar: US National Science Foundation, US Department of Defense
Bir yerde sunuluyor: 16
A Fundamental Tradeoff between Computation and Communication in Distributed Computing
S Li, MA Maddah-Ali, Q Yu, AS Avestimehr
arXiv preprint arXiv:1604.07086, 2016
Zorunlu olanlar: US National Science Foundation
Polynomial codes: an optimal design for high-dimensional coded matrix multiplication
Q Yu, M Maddah-Ali, S Avestimehr
Advances in Neural Information Processing Systems, 4403-4413, 2017
Zorunlu olanlar: US National Science Foundation, US Department of Defense
Lagrange coded computing: Optimal design for resiliency, security, and privacy
Q Yu, S Li, N Raviv, SMM Kalan, M Soltanolkotabi, SA Avestimehr
The 22nd International Conference on Artificial Intelligence and Statistics …, 2019
Zorunlu olanlar: US National Science Foundation, US Department of Defense
The exact rate-memory tradeoff for caching with uncoded prefetching
Q Yu, MA Maddah-Ali, AS Avestimehr
IEEE Transactions on Information Theory 64 (2), 1281-1296, 2018
Zorunlu olanlar: US National Science Foundation, US Department of Defense
Straggler mitigation in distributed matrix multiplication: Fundamental limits and optimal coding
Q Yu, MA Maddah-Ali, AS Avestimehr
IEEE Transactions on Information Theory 66 (3), 1920-1933, 2020
Zorunlu olanlar: US National Science Foundation, US Department of Defense
Characterizing the rate-memory tradeoff in cache networks within a factor of 2
Q Yu, MA Maddah-Ali, AS Avestimehr
IEEE Transactions on Information Theory 65 (1), 647-663, 2019
Zorunlu olanlar: US National Science Foundation, US Department of Defense
A scalable framework for wireless distributed computing
S Li, Q Yu, MA Maddah-Ali, AS Avestimehr
IEEE/ACM Transactions on Networking 25 (5), 2643-2654, 2017
Zorunlu olanlar: US National Science Foundation, US Department of Defense
Entangled polynomial codes for secure, private, and batch distributed matrix multiplication: Breaking the" cubic" barrier
Q Yu, AS Avestimehr
2020 IEEE International Symposium on Information Theory (ISIT), 245-250, 2020
Zorunlu olanlar: US National Science Foundation, US Department of Defense
Coded fourier transform
Q Yu, MA Maddah-Ali, AS Avestimehr
2017 55th Annual Allerton Conference on Communication, Control, and …, 2017
Zorunlu olanlar: US National Science Foundation, US Department of Defense
How to Optimally Allocate Resources for Coded Distributed Computing?
Q Yu, S Li, MA Maddah-Ali, AS Avestimehr
IEEE International Conference on Communications 2017, 2017
Zorunlu olanlar: US National Science Foundation, US Department of Defense
Edge-facilitated wireless distributed computing
S Li, Q Yu, MA Maddah-Ali, AS Avestimehr
2016 IEEE Global Communications Conference (GLOBECOM), 1-7, 2016
Zorunlu olanlar: US National Science Foundation
Minimax regret of switching-constrained online convex optimization: No phase transition
L Chen, Q Yu, H Lawrence, A Karbasi
Advances in Neural Information Processing Systems 33, 2020
Zorunlu olanlar: US National Science Foundation, US Department of Defense
Ising model on locally tree-like graphs: Uniqueness of solutions to cavity equations
Q Yu, Y Polyanskiy
IEEE Transactions on Information Theory, 2023
Zorunlu olanlar: US National Science Foundation
Harmonic coding: An optimal linear code for privacy-preserving gradient-type computation
Q Yu, AS Avestimehr
2019 IEEE International Symposium on Information Theory (ISIT), 1102-1106, 2019
Zorunlu olanlar: US National Science Foundation, US Department of Defense
Optimal Sample Complexity Bounds for Non-convex Optimization under Kurdyka-Lojasiewicz Condition
Q Yu, Y Wang, B Huang, Q Lei, JD Lee
International Conference on Artificial Intelligence and Statistics, 6806-6821, 2023
Zorunlu olanlar: US National Science Foundation, US Department of Defense
Uniqueness of Distributional BP Fixed Point in Ising Model on Trees
Q Yu, Y Polyanskiy
2023 IEEE International Symposium on Information Theory (ISIT), 2476-2481, 2023
Zorunlu olanlar: US National Science Foundation
Yayıncılık ve maddi kaynak bilgileri otomatik olarak bir bilgisayar programı tarafından belirlenmektedir