Online Embeddings
Name
Indyk_On-line embeddings.pdf
Size
323.58 KB
Format
Adobe PDF
Checksum (MD5)
fa06b082df76688711327b8f48059436
Author(s)
Indyk, Piotr
Magen, Avner
Sidiropoulos, Anastasios
Zouzias, Anastasios
Date Issued
August 2010
Journal
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Publisher
Springer Berlin/Heidelberg
Citation
Indyk, Piotr et al. “Online Embeddings.” Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Ed. Maria Serna et al. Vol. 6302. (Lecture Notes in Computer Science, 6302) Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. 246-259.
Version
Author's final manuscript
Abstract
We initiate the study of on-line metric embeddings. In such an embedding we are given a sequence of n points X = x [subscript 1],...,x [subscript n] one by one, from a metric space M = (X,D). Our goal is to compute a low-distortion embedding of M into some host space, which has to be constructed in an on-line fashion, so that the image of each x i depends only on x [subscript 1],...,x [subscript i] . We prove several results translating existing embeddings to the on-line setting, for the case of embedding into ℓ [subscript p] spaces, and into distributions over ultrametrics.
Description
13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-15369-3_19
