| dc.contributor.author | Indyk, Piotr | |
| dc.contributor.author | Magen, Avner | |
| dc.contributor.author | Sidiropoulos, Anastasios | |
| dc.contributor.author | Zouzias, Anastasios | |
| dc.date.accessioned | 2012-08-08T19:20:45Z | |
| dc.date.available | 2012-08-08T19:20:45Z | |
| dc.date.issued | 2010-08 | |
| dc.identifier.isbn | 978-3-642-15368-6 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/72043 | |
| dc.description | 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings | en_US |
| dc.description.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. | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Springer Berlin/Heidelberg | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1007/978-3-642-15369-3_19 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike 3.0 | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
| dc.source | Other University Web Domain | en_US |
| dc.title | Online Embeddings | en_US |
| dc.type | Article | en_US |
| dc.identifier.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. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.contributor.approver | Indyk, Piotr | |
| dc.contributor.mitauthor | Indyk, Piotr | |
| dc.relation.journal | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| dspace.orderedauthors | Indyk, Piotr; Magen, Avner; Sidiropoulos, Anastasios; Zouzias, Anastasios | en |
| dc.identifier.orcid | https://orcid.org/0000-0002-7983-9524 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
| mit.metadata.status | Complete | |
