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