A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Nathaniel Lahn, Sharath Raghvendra, Jiacheng Ye. A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning. In Marc'Aurelio Ranzato, Alina Beygelzimer, Yann N. Dauphin, Percy Liang, Jennifer Wortman Vaughan, editors, Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual. pages 16885-16898, 2021. [doi]

This author has not been identified. Look up 'Nathaniel Lahn' in GoogleThis author has not been identified. Look up 'Sharath Raghvendra' in GoogleThis author has not been identified. Look up 'Jiacheng Ye' in Google

runs on WebDSL