On Geometric Prototype and Applications
From MaRDI portal
Publication:5009580
DOI10.4230/LIPIcs.ESA.2018.23OpenAlexW2963047718MaRDI QIDQ5009580
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1804.09655
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- On the approximation of correlation clustering and consensus clustering
- The Mailman algorithm: a note on matrix-vector multiplication
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- The earth mover's distance as a metric for image retrieval
- Ensemble clustering using semidefinite programming with applications
- Bichromatic 2-center of pairs of points
- Matching point sets with respect to the earth mover's distance
- Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- Fast Discrete Distribution Clustering Using Wasserstein Barycenter With Sparse Support
- Least squares quantization in PCM
- An elementary proof of a theorem of Johnson and Lindenstrauss
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
- Iterative Bregman Projections for Regularized Transportation Problems
- Parallel algorithms for geometric graph problems
- A near-linear constant-factor approximation for euclidean bipartite matching?
- Geometric median in nearly linear time
- A Unified Framework for Clustering Constrained Data without Locality Property
- A near-linear time ε-approximation algorithm for geometric bipartite matching
- A unified framework for approximating and clustering data
This page was built for publication: On Geometric Prototype and Applications
