A data-dependent approach for high-dimensional (robust) Wasserstein alignment

Cites Work

Network flows. Theory, algorithms, and applications.
The earth mover's distance as a metric for image retrieval
Title not available (Why is that?)
Least squares quantization in PCM
A generalized solution of the orthogonal Procrustes problem
Title not available (Why is that?)
A polynomial time primal network simplex algorithm for minimum cost flows
PLANE WITH $A_{\infty}$ -WEIGHTED METRIC NOT BILIPSCHITZ EMBEDDABLE TO ${\bb R}^n$
Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
Clustering to minimize the maximum intercluster distance
A MODEL OF LARGE-SCALE PROTEOME EVOLUTION
A strongly polynomial minimum cost circulation algorithm
Geometry Helps in Matching
Finding minimum-cost circulations by canceling negative cycles
A theory of learning from different domains
Algorithms for the transportation problem in geometric settings
Bypassing the embedding
Title not available (Why is that?)
Polynomial dual network simplex algorithms
Title not available (Why is that?)
Finding nearest neighbors in growth-restricted metrics
Algorithms and Computation
Faster algorithms for the geometric transportation problem
Randomized partition trees for nearest neighbor search
Handbook of Fingerprint Recognition
Title not available (Why is that?)
A near-linear time ε-approximation algorithm for geometric bipartite matching
Parallel algorithms for geometric graph problems
A near-linear constant-factor approximation for Euclidean bipartite matching?
Parallel approximate undirected shortest paths via low hop emulators
Matching point sets with respect to the earth mover's distance
Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolation
New streaming algorithms for high dimensional EMD and MST
FPTAS for minimizing the earth mover's distance under rigid transformations and related problems
Efficient Sketches for Earth-Mover Distance, with Applications
Generalized preconditioning and undirected minimum-cost flow
Core-sets: updated survey
Preconditioning for the Geometric Transportation Problem
A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread

This page was built for publication: A data-dependent approach for high-dimensional (robust) Wasserstein alignment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579774)