Labelings vs. Embeddings: On Distributed Representations of Distances

DOI10.1137/1.9781611975994.65MaRDI QIDQ5146836zbMATH OpenOpenAlexFDO

Authors Arnold Filtser, Robert Krauthgamer, Lee-Ad Gottlieb

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.06857

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(5)

• Visualizing the effects of a changing distance on data using continuous embeddings
• Lossless prioritized embeddings
• Labelings vs. embeddings: on distributed and prioritized representations of distances
• Scattering and sparse partitions, and their applications
• Scattering and sparse partitions, and their applications

This page was built for publication: Labelings vs. Embeddings: On Distributed Representations of Distances

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