A Robust Exact Algorithm for the Euclidean Bipartite Matching Problem

Neural Information Processing Systems 

Algorithms for the minimum-cost bipartite matching can be used to estimate Wasserstein distance between two distributions.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found