Guanlin Mo

According to our database, Guanlin Mo authored at least 3 papers between 2024 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2025

Relax and Merge: A Simple Yet Effective Framework for Solving Fair k-Means and k-sparse Wasserstein Barycenter Problems.

Shihong Song, Guanlin Mo, Hu Ding

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

2024

Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms.

Guanlin Mo, Shihong Song, Hu Ding

Proc. ACM Manag. Data, 2024

Relax and Merge: A Simple Yet Effective Framework for Solving Fair <i>k</i>-Means and <i>k</i>-sparse Wasserstein Barycenter Problems.

Shihong Song, Guanlin Mo, Qingyuan Yang, Hu Ding

CoRR, 2024