From post

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.

 

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

Clairvoyant Mechanisms for Online Auctions., , , и . COCOON, том 9797 из Lecture Notes in Computer Science, стр. 3-14. Springer, (2016)Rethinking Semi-Supervised Imbalanced Node Classification from Bias-Variance Decomposition., , , , и . CoRR, (2023)Learning Based Proximity Matrix Factorization for Node Embedding., , , и . KDD, стр. 2243-2253. ACM, (2021)Joint Representation Learning of Legislator and Legislation for Roll Call Prediction., , , , , и . IJCAI, стр. 1424-1430. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..Near Optimal Frequent Directions for Sketching Dense and Sparse Matrices.. ICML, том 80 из Proceedings of Machine Learning Research, стр. 2053-2062. PMLR, (2018)Why Propagate Alone? Parallel Use of Labels and Features on Graphs., , , , , , , , , и . ICLR, OpenReview.net, (2022)On Coresets for Clustering in Small Dimensional Euclidean spaces., , , и . ICML, том 202 из Proceedings of Machine Learning Research, стр. 13891-13915. PMLR, (2023)Randomized algorithms for tracking distributed count, frequencies, and ranks., , и . PODS, стр. 295-306. ACM, (2012)FreshGNN: Reducing Memory Access via Stable Historical Embeddings for Graph Neural Network Training., , , , , , , , , и . Proc. VLDB Endow., 17 (6): 1473-1486 (февраля 2024)Communication complexity of approximate maximum matching in the message-passing model., , , и . CoRR, (2017)