Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
We initiate the study of on-line metric embeddings. In such an embedding we are given a sequence of n points X = x1, . . . , xn one by one, from a metric space M = (X, D). Our goal...
Piotr Indyk, Avner Magen, Anastasios Sidiropoulos,...
For various 3D shape analysis tasks, the LaplaceBeltrami(LB) embedding has become increasingly popular as it enables the efficient comparison of shapes based on intrinsic geometry...
Rongjie Lai, Yonggang Shi, Kevin Scheibel, Scott F...
We devise a new embedding technique, which we call measured descent, based on decomposing a metric space locally, at varying speeds, according to the density of some probability m...
Robert Krauthgamer, James R. Lee, Manor Mendel, As...