Crowd Counting: A view around state-of-the-art
-
Updated
Dec 23, 2023 - Jupyter Notebook
Crowd Counting: A view around state-of-the-art
Computational optimal transport
Python Implementation of "Fast Computation of Wasserstein Barycenters"
[ICML 2023] Official code for our paper: 'Conditional Tree Matching for Inference-Time Adaptation of Tree Prediction Models'
Sparse simplex projection-based Wasserstein k-means
Python translation of Cuturi's MATLAB code for Sinkhorn Optimal Transport.
🦆 A simple sinkhorn algorithm to solve optimal transport problem writen in Matlab
Code for "A MFG Model for the Dynamics of Cities" (Barilla, Carlier, Lasry 2021)
The implementation for the paper "On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm".
Pseudo-labeling for tabular data
Optimal transport algorithms for Julia
Add a description, image, and links to the sinkhorn-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the sinkhorn-algorithm topic, visit your repo's landing page and select "manage topics."