From post

To randomize or not to randomize: space optimal summaries for hyperlink analysis

, , , , и . WWW '06: Proceedings of the 15th international conference on World Wide Web, стр. 297--306. New York, NY, USA, ACM Press, (2006)
DOI: 10.1145/1135777.1135823

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.

 

Другие публикации лиц с тем же именем

Improved Approximation Algorithms for Large Matrices via Random Projections. FOCS, стр. 143-152. IEEE Computer Society, (2006)A sparse Johnson: Lindenstrauss transform., , и . STOC, стр. 341-350. ACM, (2010)Searching a Small National Domain - Preliminary Report., , , и . WWW (Posters), (2003)Rethinking Attention with Performers., , , , , , , , , и 3 other автор(ы). CoRR, (2020)Faster least squares approximation., , , и . Numerische Mathematik, 117 (2): 219-249 (2011)Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries., , , , и . IACR Cryptol. ePrint Arch., (2024)Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs., , , и . AAAI, стр. 7235-7243. AAAI Press, (2023)Efficient Graph Field Integrators Meet Point Clouds., , , , , , , , , и 6 other автор(ы). CoRR, (2023)Efficient Graph Field Integrators Meet Point Clouds., , , , , , , , , и 6 other автор(ы). ICML, том 202 из Proceedings of Machine Learning Research, стр. 5978-6004. PMLR, (2023)Rethinking Attention with Performers., , , , , , , , , и 3 other автор(ы). ICLR, OpenReview.net, (2021)