Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Gennaro Auricchio, Federico Bassetti, Stefano Gualandi, Marco Veneroni. Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs. In Samy Bengio, Hanna M. Wallach, Hugo Larochelle, Kristen Grauman, Nicolò Cesa-Bianchi, Roman Garnett, editors, Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, 3-8 December 2018, Montréal, Canada. pages 5798-5808, 2018. [doi]

This author has not been identified. Look up 'Gennaro Auricchio' in GoogleThis author has not been identified. Look up 'Federico Bassetti' in GoogleThis author has not been identified. Look up 'Stefano Gualandi' in GoogleThis author has not been identified. Look up 'Marco Veneroni' in Google

runs on WebDSL