Piotr Indyk
Piotr Indyk
Professor of Electrical Engineering and Computer Science, MIT
Verified email at mit.edu - Homepage
Title
Cited by
Cited by
Year
Approximate nearest neighbors: towards removing the curse of dimensionality
P Indyk, R Motwani
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
45361998
Similarity search in high dimensions via hashing
A Gionis, P Indyk, R Motwani
Vldb 99 (6), 518-529, 1999
37421999
Locality-sensitive hashing scheme based on p-stable distributions
M Datar, N Immorlica, P Indyk, VS Mirrokni
Proceedings of the twentieth annual symposium on Computational geometry, 253-262, 2004
29042004
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
A Andoni, P Indyk
Foundations of Computer Science, 2006. FOCS'06. 47th Annual IEEE Symposium …, 2006
24912006
Enhanced hypertext categorization using hyperlinks
S Chakrabarti, B Dom, P Indyk
Acm Sigmod Record 27 (2), 307-318, 1998
11301998
Maintaining stream statistics over sliding windows
M Datar, A Gionis, P Indyk, R Motwani
SIAM journal on computing 31 (6), 1794-1813, 2002
10492002
Nearest-neighbor methods in learning and vision: theory and practice (neural information processing)
G Shakhnarovich, T Darrell, P Indyk
The MIT press, 2006
1012*2006
Stable distributions, pseudorandom generators, embeddings and data stream computation
P Indyk
Proceedings 41st Annual Symposium on Foundations of Computer Science, 189-197, 2000
716*2000
Finding interesting associations without support pruning
E Cohen, M Datar, S Fujiwara, A Gionis, P Indyk, R Motwani, JD Ullman, ...
IEEE Transactions on Knowledge and Data Engineering 13 (1), 64-78, 2001
5752001
Approximate clustering via core-sets
M Bādoiu, S Har-Peled, P Indyk
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
4382002
Combining geometry and combinatorics: A unified approach to sparse signal recovery
R Berinde, AC Gilbert, P Indyk, H Karloff, MJ Strauss
2008 46th Annual Allerton Conference on Communication, Control, and …, 2008
4132008
Sparse recovery using sparse matrices
A Gilbert, P Indyk
Proceedings of the IEEE 98 (6), 937-947, 2010
3542010
Fast, small-space algorithms for approximate histogram maintenance
AC Gilbert, S Guha, P Indyk, Y Kotidis, S Muthukrishnan, MJ Strauss
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
3472002
Simple and practical algorithm for sparse Fourier transform
H Hassanieh, P Indyk, D Katabi, E Price
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
3362012
Near-optimal sparse Fourier representations via sampling
AC Gilbert, S Guha, P Indyk, S Muthukrishnan, M Strauss
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
3332002
Mining the stock market (extended abstract) which measure is best?
M Gavrilov, D Anguelov, P Indyk, R Motwani
Proceedings of the sixth ACM SIGKDD international conference on Knowledge …, 2000
3152000
Algorithmic applications of low-distortion geometric embeddings
P Indyk
Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 10-33, 2001
3132001
Nearly optimal sparse fourier transform
H Hassanieh, P Indyk, D Katabi, E Price
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
2902012
Fast estimation of diameter and shortest paths (without matrix multiplication)
D Aingworth, C Chekuri, P Indyk, R Motwani
SIAM Journal on Computing 28 (4), 1167-1181, 1999
2881999
Approximate nearest neighbor: Towards removing the curse of dimensionality
S Har-Peled, P Indyk, R Motwani
Theory of computing 8 (1), 321-350, 2012
2872012
The system can't perform the operation now. Try again later.
Articles 1–20