Results 1  10
of
238,104
Advances in metric embedding theory
 IN STOC ’06: PROCEEDINGS OF THE THIRTYEIGHTH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 2006
"... Metric Embedding plays an important role in a vast range of application areas such as computer vision, computational biology, machine learning, networking, statistics, and mathematical psychology, to name a few. The theory of metric embedding received much attention in recent years by mathematicians ..."
Abstract

Cited by 38 (14 self)
 Add to MetaCart
Metric Embedding plays an important role in a vast range of application areas such as computer vision, computational biology, machine learning, networking, statistics, and mathematical psychology, to name a few. The theory of metric embedding received much attention in recent years
CSC2414 Metric Embeddings
"... Lecture 7: Lower bounds on the embeddability in ¡£ ¢ via expander graphs and some algorithmic connections to ¡¥¤ Notes taken by Periklis Papakonstantinou revised by Hamed Hatami Summary: In view of Bourgain’s upper bound a central question in finite metric embeddings concerns explicit constructions ..."
Abstract
 Add to MetaCart
Lecture 7: Lower bounds on the embeddability in ¡£ ¢ via expander graphs and some algorithmic connections to ¡¥¤ Notes taken by Periklis Papakonstantinou revised by Hamed Hatami Summary: In view of Bourgain’s upper bound a central question in finite metric embeddings concerns explicit constructions
Metric embeddings with relaxed guarantees
 IN PROCEEDINGS OF THE 46TH IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 2005
"... We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of all distances to be arbitrarily distorted. This definition is motivated by recent research in the networking community, whic ..."
Abstract

Cited by 24 (6 self)
 Add to MetaCart
We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of all distances to be arbitrarily distorted. This definition is motivated by recent research in the networking community
Computational Metric Embeddings
, 2008
"... We study the problem of computing a lowdistortion embedding between two metric spaces. More precisely given an input metric space M we are interested in computing in polynomial time an embedding into a host space M ′ with minimum multiplicative distortion. This problem arises naturally in many appl ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We study the problem of computing a lowdistortion embedding between two metric spaces. More precisely given an input metric space M we are interested in computing in polynomial time an embedding into a host space M ′ with minimum multiplicative distortion. This problem arises naturally in many
Metric Embeddings with Relaxed Guarantees
, 2008
"... We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of all distances to be arbitrarily distorted. This definition is motivated by recent research in the networking community, whic ..."
Abstract
 Add to MetaCart
We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of all distances to be arbitrarily distorted. This definition is motivated by recent research in the networking community
Metric Embeddings with Relaxed Guarantees
, 2005
"... We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of all distances to be arbitrarily distorted. This definition is motivated by recent research in the networking community, w ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of all distances to be arbitrarily distorted. This definition is motivated by recent research in the networking community
Approximation Algorithms for Metric Embedding Problems
, 2005
"... We initiate the study of metric embedding problems from an approximation point of view. Metric embedding is a map from a guest metric to a host metric. The quality of the embedding is defined in terms of distortion, the ratio by which pairwise distances get skewed in the host metric. While metric em ..."
Abstract
 Add to MetaCart
We initiate the study of metric embedding problems from an approximation point of view. Metric embedding is a map from a guest metric to a host metric. The quality of the embedding is defined in terms of distortion, the ratio by which pairwise distances get skewed in the host metric. While metric
Graph Augmentation via Metric Embedding
"... Abstract. Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between any pair of nodes in a graph, with only a partial knowledge of distances. Following this seminal work, a major ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
challenge was to extend this model to larger classes of graphs than regular meshes, introducing the concept of augmented graphs navigability. In this paper, we propose an original method of augmentation, based on metrics embeddings. Precisely, we prove that, for any ε>0, any graph G such that its
Local global tradeoffs in metric embeddings
 In Proceedings of the FortyEighth Annual IEEE Symposium on Foundations of Computer Science
, 2007
"... Suppose that every k points in a n point metric space X are Ddistortion embeddable into ℓ1. We give upper and lower bounds on the distortion required to embed the entire space X into ℓ1. This is a natural mathematical question and is also motivated by the study of relaxations obtained by liftandp ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Suppose that every k points in a n point metric space X are Ddistortion embeddable into ℓ1. We give upper and lower bounds on the distortion required to embed the entire space X into ℓ1. This is a natural mathematical question and is also motivated by the study of relaxations obtained by lift
Results 1  10
of
238,104