( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Power of Louvain in the Stochastic Block Model.

, , , и . NeurIPS, (2020)

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.

Bodo David

Erich David

Ernst David

Baruch Davidoff

Frida David

 

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

Almost-linear Time Approximation Algorithm to Euclidean k-median and k-means., и . CoRR, (2024)Approximation Algorithms and Sketches for Clustering. (Algorithmes d'approximation et sketches pour les problèmes de clustering).. Sorbonne University, Paris, France, (2022)Dominating Sets and Connected Dominating Sets in Dynamic Graphs., , , и . STACS, том 126 из LIPIcs, стр. 35:1-35:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Community Recovery in the Degree-Heterogeneous Stochastic Block Model., , и . COLT, том 178 из Proceedings of Machine Learning Research, стр. 1662-1692. PMLR, (2022)Towards optimal lower bounds for k-median and k-means coresets., , , и . STOC, стр. 1038-1051. ACM, (2022)Fully Dynamic k-Means Coreset in Near-Optimal Update Time., , и . CoRR, (2024)Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs., и . ESA, том 173 из LIPIcs, стр. 46:1-46:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs., , и . ESA, том 87 из LIPIcs, стр. 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)An Improved Local Search Algorithm for k-Median., , , , и . SODA, стр. 1556-1612. SIAM, (2022)A Massively Parallel Modularity-Maximizing Algorithm with Provable Guarantees., , и . PODC, стр. 356-365. ACM, (2022)