K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance
From MaRDI portal
Publication:5419132
DOI10.1145/1993636.1993720zbMath1288.68124arXiv1104.4674OpenAlexW2035331345MaRDI QIDQ5419132
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.4674
Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Numerical computation of matrix norms, conditioning, scaling (65F35) Approximation algorithms (68W25)
Related Items (1)
This page was built for publication: K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance