( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximation Scheme for Weighted Metric Clustering via Sherali-Adams.

, , , и . AAAI, стр. 7926-7934. AAAI Press, (2024)

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.

Grigory Panasenko

Grigory Soloweitschik

Grigory Genikhovich

Grigory Kuznetsov

Grigory Shevchenko

 

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

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