( en | de | ru )

 

Disambiguation of "Sarlós, Tamás"

Author of the publication

copydeleteadd this publication to your clipboard
On the feasibility of low-rank approximation for personalized PageRank.

, , and . WWW (Special interest tracks and posters), page 972-973. ACM, (2005)

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

Fast locality-sensitive hashing., , and . KDD, page 1073-1081. ACM, (2011)Linear Additive Markov Processes., , , and . WWW, page 411-419. ACM, (2017)Caching with Dual Costs., , and . WWW (Companion Volume), page 643-652. ACM, (2017)FAVOR#: Sharp Attention Kernel Approximations via New Classes of Positive Random Features., , , , , and . CoRR, (2023)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)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)Searching a Small National Domain - Preliminary Report., , , and . WWW (Posters), (2003)Improved Approximation Algorithms for Large Matrices via Random Projections. FOCS, page 143-152. IEEE Computer Society, (2006)