ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > AUTHORS > PIOTR INDYK:
All reports by Author Piotr Indyk:

TR07-048 | 3rd April 2007
Alexandr Andoni, Piotr Indyk, Robert Krauthgamer

Earth Mover Distance over High-Dimensional Spaces

The Earth Mover Distance (EMD) between two equal-size sets of points in R^d is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metric for comparing sets of features, and as such, it has received significant interest in computer vision. Motivated ... more >>>

TR06-126 | 2nd October 2006
Piotr Indyk

Uncertainty Principles, Extractors, and Explicit Embeddings of L2 into L1

We give an explicit construction of a constant-distortion embedding of an n-dimensional L_2 space into an n^{1+o(1)}-dimensional L_1 space. more >>>

TR05-117 | 17th September 2005
Piotr Indyk, David P. Woodruff

Polylogarithmic Private Approximations and Efficient Matching

A private approximation of a function f is defined to be another function F that approximates f in the usual sense, but does not reveal any information about the input x other than what can be deduced from f(x). We give the first two-party private approximation of the Euclidean distance ... more >>>

TR02-024 | 24th April 2002
Piotr Indyk

List-decoding in Linear Time

Spielman showed that one can construct error-correcting codes capable of correcting a constant fraction $\delta << 1/2$ of errors, and that are encodable/decodable in linear time. Guruswami and Sudan showed that it is possible to correct more than $50\%$ of errors (and thus exceed the ``half of the minimum distance ... more >>>



ISSN 1433-8092 | Imprint