{"total":18,"rows":[{"id":"2401.15889","title":"Sliced Wasserstein with Random-Path Projecting Directions","created":"2024-01-29","cited_by_count":15,"area":null},{"id":"2301.03749","title":"Markovian Sliced Wasserstein Distances: Beyond Independent Projections","created":"2023-01-10","cited_by_count":11,"area":null},{"id":"2302.03232","title":"Linear Optimal Partial Transport Embedding","created":"2023-02-07","cited_by_count":8,"area":null},{"id":"2406.13725","title":"Tree-Sliced Wasserstein Distance: A Geometric Perspective","created":"2024-06-19","cited_by_count":7,"area":null},{"id":"2307.05705","title":"Measure transfer via stochastic slicing and matching","created":"2023-07-11","cited_by_count":6,"area":null},{"id":"2310.06002","title":"LCOT: Linear circular optimal transport","created":"2023-10-09","cited_by_count":4,"area":null},{"id":"2511.19741","title":"Efficient Transferable Optimal Transport via Min-Sliced Transport Plans","created":"2025-11-24","cited_by_count":4,"area":null},{"id":"2511.13229","title":"Laplace Learning in Wasserstein Space","created":"2025-11-17","cited_by_count":3,"area":null},{"id":"2307.13571","title":"PT$\\mathrm{L}^{p}$: Partial Transport $\\mathrm{L}^{p}$ Distances","created":"2023-07-25","cited_by_count":2,"area":null},{"id":"2309.15787","title":"Partial Transport for Point-Cloud Registration","created":"2023-09-27","cited_by_count":2,"area":null},{"id":"2410.16718","title":"Learning Partial Graph Matching via Optimal Partial Transport","created":"2024-10-22","cited_by_count":2,"area":null},{"id":"2409.10499","title":"Partial Distribution Matching via Partial Wasserstein Adversarial Networks","created":"2024-09-16","cited_by_count":1,"area":null},{"id":"2410.16669","title":"Linear Partial Gromov-Wasserstein Embedding","created":"2024-10-22","cited_by_count":1,"area":null},{"id":"2407.06481","title":"Sinkhorn algorithms and linear programming solvers for optimal partial transport problems","created":"2024-07-09","cited_by_count":0,"area":null},{"id":"2601.12423","title":"HOT-POT: Optimal Transport for Sparse Stereo Matching","created":"2026-01-18","cited_by_count":0,"area":null},{"id":"2606.02022","title":"Ranking vs. Assignment: The Metric Mismatch in Multi-View Object Association","created":"2026-06-01","cited_by_count":0,"area":null},{"id":"2608.23910","title":"Partial Optimal Transport on the Circle for All Transported Masses in O(N log N)","created":"2026-08-24","cited_by_count":0,"area":null},{"id":"2610.04091","title":"Robust blind unmixing: A geometric approach to overcoming basis variation","created":"2026-10-02","cited_by_count":0,"area":null}],"next_cursor":null}