diff options
| author | Rémi Flamary <remi.flamary@gmail.com> | 2018-09-24 10:33:41 +0200 |
|---|---|---|
| committer | Rémi Flamary <remi.flamary@gmail.com> | 2018-09-24 10:33:41 +0200 |
| commit | 414331cbec21f00333e9de36a8790666c373e93c (patch) | |
| tree | 5e5fab72c66d2e885c2d98bfc9567b527dfdb62e /README.md | |
| parent | 75fe96c183852971bb7be1da39af202b9f7d6e6c (diff) | |
| parent | c9b99df8fffec1dcc6802ef43b6192774817c5fb (diff) | |
Merge readme with master
Diffstat (limited to 'README.md')
| -rw-r--r-- | README.md | 4 |
1 files changed, 3 insertions, 1 deletions
@@ -230,4 +230,6 @@ You can also post bug reports and feature requests in Github issues. Make sure t [20] Cuturi, M. and Doucet, A. (2014) [Fast Computation of Wasserstein Barycenters](http://proceedings.mlr.press/v32/cuturi14.html). International Conference in Machine Learning -[21] J. Altschuler, J.Weed, P. Rigollet, (2017) Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration, Advances in Neural Information Processing Systems (NIPS) 31
\ No newline at end of file +[21] Solomon, J., De Goes, F., Peyré, G., Cuturi, M., Butscher, A., Nguyen, A. & Guibas, L. (2015). [Convolutional wasserstein distances: Efficient optimal transportation on geometric domains](https://dl.acm.org/citation.cfm?id=2766963). ACM Transactions on Graphics (TOG), 34(4), 66. + +[21] J. Altschuler, J.Weed, P. Rigollet, (2017) [Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration](https://papers.nips.cc/paper/6792-near-linear-time-approximation-algorithms-for-optimal-transport-via-sinkhorn-iteration.pdf), Advances in Neural Information Processing Systems (NIPS) 31 |