diff options
| author | tlacombe <lacombe1993@gmail.com> | 2020-03-31 12:55:51 +0200 |
|---|---|---|
| committer | tlacombe <lacombe1993@gmail.com> | 2020-03-31 12:55:51 +0200 |
| commit | a924e71d2f1a649ca389cfeceb678cc45aaf9fa7 (patch) | |
| tree | f0f0eadb13deec313f9de86f68fd3a996b99e380 /src/python/doc/wasserstein_distance_user.rst | |
| parent | e6c21aa957bbf66854f31824cd4313c61f7ea9fc (diff) | |
micro modif changed a word to avoid repetition
Diffstat (limited to 'src/python/doc/wasserstein_distance_user.rst')
| -rw-r--r-- | src/python/doc/wasserstein_distance_user.rst | 2 |
1 files changed, 1 insertions, 1 deletions
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:: |