From a924e71d2f1a649ca389cfeceb678cc45aaf9fa7 Mon Sep 17 00:00:00 2001 From: tlacombe Date: Tue, 31 Mar 2020 12:55:51 +0200 Subject: micro modif changed a word to avoid repetition --- src/python/doc/wasserstein_distance_user.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'src/python') diff --git a/src/python/doc/wasserstein_distance_user.rst b/src/python/doc/wasserstein_distance_user.rst index 6de05afc..a077f9a4 100644 --- a/src/python/doc/wasserstein_distance_user.rst +++ b/src/python/doc/wasserstein_distance_user.rst @@ -112,7 +112,7 @@ to the Lloyd algorithm to estimate a solution to the k-means problem). The local minimum returned depends on the initialization of the barycenter. The combinatorial structure of the algorithm limits its -scaling on large scale problems (thousands of diagrams and of points +performances on large scale problems (thousands of diagrams and of points per diagram). .. figure:: -- cgit v1.2.3