Results 1  10
of
313,705
On Metric Ramseytype Dichotomies
 J. London Math. Soc
, 2003
"... The classical Ramsey theorem, states that every graph contains either a large clique or a large independent set. Here we investigate similar dichotomic phenomena in the context of finite metric spaces. Namely, we prove statements of the form "Every finite metric space contains a large subspace ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
The classical Ramsey theorem, states that every graph contains either a large clique or a large independent set. Here we investigate similar dichotomic phenomena in the context of finite metric spaces. Namely, we prove statements of the form "Every finite metric space contains a large subspace
On Metric RamseyType Phenomena (Extended Abstract)
, 2003
"... This paper deals with Ramseytype theorems for metric spaces. Such a theorem states that every n point metric space contains a large subspace which can be embedded with some fixed distortion in a metric space from some special class. Our main theorem states that for any ffl> 0, every n point met ..."
Abstract
 Add to MetaCart
This paper deals with Ramseytype theorems for metric spaces. Such a theorem states that every n point metric space contains a large subspace which can be embedded with some fixed distortion in a metric space from some special class. Our main theorem states that for any ffl> 0, every n point
A Ramseytype Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems
 In 42nd Annual IEEE Symposium on Foundations of Computer Science
, 2001
"... This paper gives a nearly logarithmic lower bound on the randomized competitive ratio for the Metrical Task Systems model [BLS92]. This implies a similar lower bound for the extensively studied Kserver problem. Our proof is based on proving a Ramseytype theorem for metric spaces. In particular we ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
This paper gives a nearly logarithmic lower bound on the randomized competitive ratio for the Metrical Task Systems model [BLS92]. This implies a similar lower bound for the extensively studied Kserver problem. Our proof is based on proving a Ramseytype theorem for metric spaces. In particular we
Searching in metric spaces
, 2001
"... The problem of searching the elements of a set that are close to a given query element under some similarity criterion has a vast number of applications in many branches of computer science, from pattern recognition to textual and multimedia information retrieval. We are interested in the rather gen ..."
Abstract

Cited by 432 (38 self)
 Add to MetaCart
The problem of searching the elements of a set that are close to a given query element under some similarity criterion has a vast number of applications in many branches of computer science, from pattern recognition to textual and multimedia information retrieval. We are interested in the rather
Gradient flows in metric spaces and in the space of probability measures
 LECTURES IN MATHEMATICS ETH ZÜRICH, BIRKHÄUSER VERLAG
, 2005
"... ..."
A DecisionTheoretic Generalization of onLine Learning and an Application to Boosting
, 1996
"... ..."
The geometry of graphs and some of its algorithmic applications
 Combinatorica
, 1995
"... In this paper we explore some implications of viewing graphs as geometric objects. This approach offers a new perspective on a number of graphtheoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations that r ..."
Abstract

Cited by 543 (20 self)
 Add to MetaCart
their geometric images. In this paper we develop efficient algorithms for embedding graphs lowdimensionally with a small distortion. Further algorithmic applications include: 0 A simple, unified approach to a number of problems on multicommodity flows, including the LeightonRae Theorem [29] and some of its
Probabilistic Approximation of Metric Spaces and its Algorithmic Applications
 In 37th Annual Symposium on Foundations of Computer Science
, 1996
"... The goal of approximating metric spaces by more simple metric spaces has led to the notion of graph spanners [PU89, PS89] and to lowdistortion embeddings in lowdimensional spaces [LLR94], having many algorithmic applications. This paper provides a novel technique for the analysis of randomized ..."
Abstract

Cited by 361 (33 self)
 Add to MetaCart
The goal of approximating metric spaces by more simple metric spaces has led to the notion of graph spanners [PU89, PS89] and to lowdistortion embeddings in lowdimensional spaces [LLR94], having many algorithmic applications. This paper provides a novel technique for the analysis of randomized
Results 1  10
of
313,705