( en | de | ru )

 

Disambiguation of "Yaroslavtsev, Grigory"

Author of the publication

copydeleteadd this publication to your clipboard
Hierarchical Clustering for Euclidean Data.

, , , and . AISTATS, volume 89 of Proceedings of Machine Learning Research, page 2721-2730. PMLR, (2019)

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.

Grigory Panasenko

Grigory Soloweitschik

Grigory Genikhovich

Grigory Kuznetsov

Grigory Shevchenko

 

Other publications of authors with the same name

"Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack., , and . AISTATS, volume 108 of Proceedings of Machine Learning Research, page 3263-3274. PMLR, (2020)Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection., , , , , , and . CoRR, (2019)Adversarially Robust Submodular Maximization under Knapsack Constraints., , , and . KDD, page 148-156. ACM, (2019)Hierarchical Clustering for Euclidean Data., , , and . AISTATS, volume 89 of Proceedings of Machine Learning Research, page 2721-2730. PMLR, (2019)Fast Fourier Sparsity Testing., and . SOSA, page 57-68. SIAM, (2020)Objective-Based Hierarchical Clustering of Deep Embedding Vectors., , and . AAAI, page 9055-9063. AAAI Press, (2021)Optimality of Linear Sketching Under Modular Updates., , and . CCC, volume 137 of LIPIcs, page 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection., , , , , , and . AISTATS, volume 108 of Proceedings of Machine Learning Research, page 3121-3132. PMLR, (2020)Tree Learning: Optimal Algorithms and Sample Complexity., , , , , and . CoRR, (2023)Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching., , and . SODA, page 1738-1756. SIAM, (2013)