Picture for Stefano Gualandi

Stefano Gualandi

The BeMi Stardust: a Structured Ensemble of Binarized Neural Networks

Add code
Dec 07, 2022
Viaarxiv icon

The Gene Mover's Distance: Single-cell similarity via Optimal Transport

Add code
Feb 01, 2021
Figure 1 for The Gene Mover's Distance: Single-cell similarity via Optimal Transport
Figure 2 for The Gene Mover's Distance: Single-cell similarity via Optimal Transport
Figure 3 for The Gene Mover's Distance: Single-cell similarity via Optimal Transport
Figure 4 for The Gene Mover's Distance: Single-cell similarity via Optimal Transport
Viaarxiv icon

The Equivalence of Fourier-based and Wasserstein Metrics on Imaging Problems

Add code
May 13, 2020
Figure 1 for The Equivalence of Fourier-based and Wasserstein Metrics on Imaging Problems
Figure 2 for The Equivalence of Fourier-based and Wasserstein Metrics on Imaging Problems
Figure 3 for The Equivalence of Fourier-based and Wasserstein Metrics on Imaging Problems
Viaarxiv icon

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

Add code
May 18, 2018
Figure 1 for Computing Kantorovich-Wasserstein Distances on $d$-dimensional histograms using $(d+1)$-partite graphs
Figure 2 for Computing Kantorovich-Wasserstein Distances on $d$-dimensional histograms using $(d+1)$-partite graphs
Figure 3 for Computing Kantorovich-Wasserstein Distances on $d$-dimensional histograms using $(d+1)$-partite graphs
Figure 4 for Computing Kantorovich-Wasserstein Distances on $d$-dimensional histograms using $(d+1)$-partite graphs
Viaarxiv icon

On the Computation of Kantorovich-Wasserstein Distances between 2D-Histograms by Uncapacitated Minimum Cost Flows

Add code
Apr 04, 2018
Figure 1 for On the Computation of Kantorovich-Wasserstein Distances between 2D-Histograms by Uncapacitated Minimum Cost Flows
Figure 2 for On the Computation of Kantorovich-Wasserstein Distances between 2D-Histograms by Uncapacitated Minimum Cost Flows
Figure 3 for On the Computation of Kantorovich-Wasserstein Distances between 2D-Histograms by Uncapacitated Minimum Cost Flows
Figure 4 for On the Computation of Kantorovich-Wasserstein Distances between 2D-Histograms by Uncapacitated Minimum Cost Flows
Viaarxiv icon