Sledovat
Piotr Indyk
Piotr Indyk
Professor of Electrical Engineering and Computer Science, MIT
E-mailová adresa ověřena na: mit.edu - Domovská stránka
Název
Citace
Citace
Rok
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
63191998
Similarity search in high dimensions via hashing
A Gionis, P Indyk, R Motwani
Vldb 99 (6), 518-529, 1999
49411999
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
40652004
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
A Andoni, P Indyk
Communications of the ACM 51 (1), 117-122, 2008
32732008
Maintaining stream statistics over sliding windows
M Datar, A Gionis, P Indyk, R Motwani
SIAM journal on computing 31 (6), 1794-1813, 2002
13272002
Enhanced hypertext categorization using hyperlinks
S Chakrabarti, B Dom, P Indyk
Acm Sigmod Record 27 (2), 307-318, 1998
12101998
Nearest-neighbor methods for learning and vision: theory and practice
editors G Shakhnarovich, T Darrell, P Indyk
1048*2006
Stable distributions, pseudorandom generators, embeddings, and data stream computation
P Indyk
Journal of the ACM (JACM) 53 (3), 307-323, 2006
8822006
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
6332001
Practical and optimal LSH for angular distance
A Andoni, P Indyk, T Laarhoven, I Razenshteyn, L Schmidt
Advances in neural information processing systems 28, 2015
6252015
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
5642002
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
4872008
Approximate nearest neighbor: Towards removing the curse of dimensionality
S Har-Peled, P Indyk, R Motwani
Theory of Computing Exchange, 2012
4842012
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
4762012
Edit distance cannot be computed in strongly subquadratic time (unless SETH is false)
A Backurs, P Indyk
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
4622015
Sparse recovery using sparse matrices
A Gilbert, P Indyk
Proceedings of the IEEE 98 (6), 937-947, 2010
4412010
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
3962012
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
3892002
Algorithmic applications of low-distortion geometric embeddings
P Indyk
Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 10-33, 2001
3862001
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
3781999
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20