ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1805.07416
  4. Cited By
Computing Kantorovich-Wasserstein Distances on $d$-dimensional
  histograms using $(d+1)$-partite graphs
v1v2 (latest)

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

18 May 2018
Gennaro Auricchio
F. Bassetti
Stefano Gualandi
Marco Veneroni
ArXiv (abs)PDFHTML

Papers citing "Computing Kantorovich-Wasserstein Distances on $d$-dimensional histograms using $(d+1)$-partite graphs"

2 / 2 papers shown
Title
A Bilevel Formalism for the Peer-Reviewing Problem
A Bilevel Formalism for the Peer-Reviewing Problem
Gennaro Auricchio
Ruixiao Zhang
Jie Zhang
Xiaohao Cai
18
1
0
23 Jul 2023
Variational Wasserstein Barycenters for Geometric Clustering
Variational Wasserstein Barycenters for Geometric Clustering
Liang Mi
31
3
0
24 Feb 2020
1