Guanlin Mo

According to our database, Guanlin Mo authored at least 4 papers between 2024 and 2026.

Collaborative distances:

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

2026

Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High Dimensions.

Kangke Cheng, Shihong Song, Guanlin Mo, Hu Ding

Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

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