( en | de | ru )

 

Disambiguation of "Sarlós, Tamás"

Author of the publication

copydeleteadd this publication to your clipboard
Faster least squares approximation.

, , , and . Numerische Mathematik, 117 (2): 219-249 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christine Tamásy

Ónodi Tamás

Nándor Tamáskovics

Erika Tamási

Markus Tamás

 

Other publications of authors with the same name

Linear Additive Markov Processes., , , and . WWW, page 411-419. ACM, (2017)Fast locality-sensitive hashing., , and . KDD, page 1073-1081. ACM, (2011)Caching with Dual Costs., , and . WWW (Companion Volume), page 643-652. ACM, (2017)Hardness of Low Rank Approximation of Entrywise Transformed Matrix Products., , , and . CoRR, (2023)Õptimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization., , , , and . CoRR, (2022)FAVOR#: Sharp Attention Kernel Approximations via New Classes of Positive Random Features., , , , , and . CoRR, (2023)Tight Dimensionality Reduction for Sketching Low Degree Polynomial Kernels., , and . NeurIPS, page 9470-9481. (2019)From block-Toeplitz matrices to differential equations on graphs: towards a general theory for scalable masked Transformers., , , , , , , , , and . ICML, volume 162 of Proceedings of Machine Learning Research, page 3962-3983. PMLR, (2022)A sparse Johnson: Lindenstrauss transform., , and . STOC, page 341-350. ACM, (2010)Improved Approximation Algorithms for Large Matrices via Random Projections. FOCS, page 143-152. IEEE Computer Society, (2006)