( en | de | ru )

 

Disambiguation of "Sarlós, Tamás"

Author of the publication

copydeleteadd this publication to your clipboard
Caching with Dual Costs.

, , and . WWW (Companion Volume), page 643-652. ACM, (2017)

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

Fastfood: Approximate Kernel Expansions in Loglinear Time., , and . CoRR, (2014)Orthogonal Estimation of Wasserstein Distances., , , , , and . AISTATS, volume 89 of Proceedings of Machine Learning Research, page 186-195. PMLR, (2019)Link-based similarity search to fight Web spam, , and . Adversarial Information Retrieval on the Web (AIRWEB), Seattle, Washington, USA, (2006)To randomize or not to randomize: space optimal summaries for hyperlink analysis, , , , and . WWW '06: Proceedings of the 15th international conference on World Wide Web, page 297--306. New York, NY, USA, ACM Press, (2006)Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs., , , and . CoRR, (2022)On Sampling Nodes in a Network., , , , and . WWW, page 471-481. ACM, (2016)Improved Approximation Algorithms for Large Matrices via Random Projections.. FOCS, page 143-152. IEEE Computer Society, (2006)Permutation indexing: fast approximate retrieval from large corpora., and . CIKM, page 1771-1776. ACM, (2013)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)