#### Filter Results:

- Full text PDF available (79)

#### Publication Year

1978

2019

- This year (9)
- Last 5 years (54)
- Last 10 years (100)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Aristides Gionis, Piotr Indyk, Rajeev Motwani
- VLDB
- 1999

The nearest or near neighbor query problems arise in a large variety of database applications usually in the context of similarity searching Of late there has been increasing interest in build ingâ€¦ (More)

- Piotr Indyk, Rajeev Motwani
- STOC
- 1998

We present two algorithms for the approximate nearest neighbor problem in high-dimensional spaces. For data sets of size n living in Rd , the algorithms require space that is only polynomial in n andâ€¦ (More)

- Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab S. Mirrokni
- Symposium on Computational Geometry
- 2004

We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under lp norm, based on p-stable distributions.Our scheme improves the running time of the earlierâ€¦ (More)

- Alexandr Andoni, Piotr Indyk
- FOCS
- 2006

The goal of this article is twofold. In the first part, we survey a family of nearest neighbor algorithms that are based on the concept of localitysensitive hashing. Many of these algorithm haveâ€¦ (More)

- Soumen Chakrabarti, Byron Dom, Piotr Indyk
- SIGMOD Conference
- 1998

A major challenge in indexing unstructured hypertext databases is to automatically extract meta-data that enables structured search using topic taxonomies, circumvents keyword ambiguity, and improvesâ€¦ (More)

- Piotr Indyk
- FOCS
- 2000

- Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani
- SIAM J. Comput.
- 2002

We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding window model. Weâ€¦ (More)

- Edith Cohen, Mayur Datar, +5 authors Cheng Yang
- IEEE Trans. Knowl. Data Eng.
- 2001

- Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price
- SODA
- 2012

We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transform of x. Theâ€¦ (More)

- Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin Strauss
- 2008 46th Annual Allerton Conference onâ€¦
- 2008

There are two main algorithmic approaches to sparse signal recovery: geometric and combinatorial. The geometric approach utilizes geometric properties of the measurement matrix Phi. A notable exampleâ€¦ (More)