受强制性开放获取政策约束的文章 - Kenneth L. Clarkson了解详情
可在其他位置公开访问的文章：15 篇
Low-rank approximation and regression in input sparsity time
KL Clarkson, DP Woodruff
Journal of the ACM (JACM) 63 (6), 1-45, 2017
强制性开放获取政策： US Department of Defense
Faster kernel ridge regression using sketching and preconditioning
H Avron, KL Clarkson, DP Woodruff
SIAM Journal on Matrix Analysis and Applications 38 (4), 1116-1138, 2017
强制性开放获取政策： US Department of Defense
The fast cauchy transform and faster robust linear regression
KL Clarkson, P Drineas, M Magdon-Ismail, MW Mahoney, X Meng, ...
SIAM Journal on Computing 45 (3), 763-810, 2016
强制性开放获取政策： US National Science Foundation
Combining data and theory for derivable scientific discovery with AI-Descartes
C Cornelio, S Dash, V Austel, TR Josephson, J Goncalves, KL Clarkson, ...
Nature Communications 14 (1), 1777, 2023
强制性开放获取政策： US Department of Energy, US Department of Defense
Dimensionality reduction for tukey regression
K Clarkson, R Wang, D Woodruff
International Conference on Machine Learning, 1262-1271, 2019
强制性开放获取政策： US Department of Defense
Low-rank PSD approximation in input-sparsity time
KL Clarkson, DP Woodruff
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
强制性开放获取政策： US Department of Defense
Quantum-inspired algorithms from randomized numerical linear algebra
N Chepurko, K Clarkson, L Horesh, H Lin, D Woodruff
International Conference on Machine Learning, 3879-3900, 2022
强制性开放获取政策： US National Science Foundation
Minimax experimental design: Bridging the gap between statistical and worst-case approaches to least squares regression
M Dereziński, KL Clarkson, MW Mahoney, MK Warmuth
Conference on Learning Theory, 1050-1069, 2019
强制性开放获取政策： US National Science Foundation, US Department of Defense
Low-rank approximation with 1/𝜖1/3 matrix-vector products
A Bakshi, KL Clarkson, DP Woodruff
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
强制性开放获取政策： US National Science Foundation, US Department of Defense
Near-optimal algorithms for linear algebra in the current matrix multiplication time
N Chepurko, KL Clarkson, P Kacham, DP Woodruff
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
强制性开放获取政策： US National Science Foundation, US National Institutes of Health
Self-improving algorithms for convex hulls
KL Clarkson, W Mulzer, C Seshadhri
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010
强制性开放获取政策： German Research Foundation
Capacity and bias of learned geometric embeddings for directed graphs
M Boratko, D Zhang, N Monath, L Vilnis, KL Clarkson, A McCallum
Advances in Neural Information Processing Systems 34, 16423-16436, 2021
强制性开放获取政策： US National Science Foundation, US Department of Defense, Chan Zuckerberg …
Self-improving algorithms for coordinatewise maxima and convex hulls
KL Clarkson, W Mulzer, C Seshadhri
SIAM Journal on Computing 43 (2), 617-653, 2014
强制性开放获取政策： German Research Foundation
Topological data analysis on noisy quantum computers
IY Akhalwaya, S Ubaru, KL Clarkson, MS Squillante, V Jejjala, YH He, ...
The Twelfth International Conference on Learning Representations, 2023
强制性开放获取政策： US Department of Defense, National Research Foundation, South Africa
Random Sampling with Removal
KL Clarkson, B Gärtner, J Lengler, M Szedlák
Discrete & Computational Geometry 64 (3), 700-733, 2020
强制性开放获取政策： Swiss National Science Foundation
出版信息和资助信息由计算机程序自动确定