| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price |
Nearly Optimal Sparse Fourier Transform  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price |
Simple and practical algorithm for sparse Fourier transform. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Piotr Indyk, Reut Levi, Ronitt Rubinfeld |
Approximating and testing k-histogram distributions in sub-linear time. |
PODS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price |
Nearly optimal sparse fourier transform. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk, Reut Levi, Ronitt Rubinfeld |
Approximating and Testing k-Histogram Distributions in Sub-linear time. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Piotr Indyk, Eric Price |
K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Khanh Do Ba, Piotr Indyk, Eric Price, David P. Woodruff |
Lower Bounds for Sparse Recovery |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Piotr Indyk, Eric Price, David P. Woodruff |
On the Power of Adaptivity in Sparse Recovery |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachlin |
Compressive sensing with local geometric features. |
Symposium on Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Khanh Do Ba, Piotr Indyk |
Sparse Recovery with Partial Support Knowledge. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Piotr Indyk, David P. Woodruff, Ning Xie |
The Complexity of Linear Dependence Problems in Vector Spaces. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Piotr Indyk, Eric Price, David P. Woodruff |
On the Power of Adaptivity in Sparse Recovery. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk, Eric Price |
K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Radu Berinde, Piotr Indyk, Graham Cormode, Martin J. Strauss |
Space-optimal heavy hitters with strong error bounds. |
ACM Trans. Database Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeeshan Syed, Collin Stultz, Manolis Kellis, Piotr Indyk, John V. Guttag |
Motif discovery in physiological datasets: A methodology for inferring predictive elements. |
TKDD |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk, Stanislaw Szarek |
A simple construction of almost-Euclidean subspaces of $\ell_1^N$ via tensor products |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Khanh Do Ba, Piotr Indyk, Eric Price, David P. Woodruff |
Lower Bounds for Sparse Recovery. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Piotr Indyk, Hung Q. Ngo, Atri Rudra |
Efficiently Decodable Non-adaptive Group Testing. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld |
Sublinear Algorithms in the External Memory Model. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk |
Sparse Recovery Using Sparse Random Matrices. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk, Stanislaw Szarek |
Almost-Euclidean Subspaces of l1N\ell_1^N via Tensor Products: A Simple Approach to Randomness Reduction. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk, Avner Magen, Anastasios Sidiropoulos, Anastasios Zouzias |
Online Embeddings. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat |
Efficient computations of l1 and l INFINITY rearrangement distances. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeeshan Syed, Piotr Indyk, John V. Guttag |
Learning Approximate Sequential Patterns for Classification. |
Journal of Machine Learning Research |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Piotr Indyk, Robert Krauthgamer |
Overcoming the l1 non-embeddability barrier: algorithms for product metrics. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Piotr Indyk, Robert Krauthgamer, Huy L. Nguyen |
Approximate line nearest neighbor in high dimensions. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld |
External Sampling. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Khanh Do Ba, Piotr Indyk, David P. Woodruff |
Efficient Sketches for Earth-Mover Distance, with Applications. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Earth-Mover Distance, streaming, embedding, sketching |
| 1 | Radu Berinde, Graham Cormode, Piotr Indyk, Martin J. Strauss |
Space-optimal heavy hitters with strong error bounds. |
PODS |
2009 |
DBLP DOI BibTeX RDF |
streaming algorithms, frequency estimation, heavy hitters |
| 1 | Gregory Shakhnarovich, Trevor Darrell, Piotr Indyk |
Nearest-Neighbor Methods in Learning and Vision. |
IEEE Transactions on Neural Networks |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sudipto Guha, Piotr Indyk, Andrew McGregor |
Sketching information divergences. |
Machine Learning |
2008 |
DBLP DOI BibTeX RDF |
Information divergences, Data stream model, Approximation algorithms, Sketches, Communication complexity |
| 1 | Alexandr Andoni, Piotr Indyk |
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. |
Commun. ACM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss |
Combining geometry and combinatorics: A unified approach to sparse signal recovery |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Gereon Frahling, Piotr Indyk, Christian Sohler |
Sampling in Dynamic Data Streams and Applications. |
Int. J. Comput. Geometry Appl. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk |
Explicit constructions for compressed sensing of sparse signals. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Piotr Indyk, Robert Krauthgamer |
Earth mover distance over high-dimensional spaces. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk, Andrew McGregor |
Declaring independence via the sketching of sketches. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk, Milan Ruzic |
Near-Optimal Sparse Recovery in the L1 Norm. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Piotr Indyk, Robert Krauthgamer |
Earth Mover Distance over High-Dimensional Spaces. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Piotr Indyk, Assaf Naor |
Nearest-neighbor-preserving embeddings. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
doubling spaces, embeddings, dimensionality reduction, Nearest neighbor |
| 1 | Piotr Indyk |
A near linear time constant factor approximation for Euclidean bichromatic matching (cost). |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihai Badoiu, Piotr Indyk, Anastasios Sidiropoulos |
Approximation algorithms for embedding general metrics into trees. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk, Anastasios Sidiropoulos |
Probabilistic embeddings of bounded genus graphs into planar graphs. |
Symposium on Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
bounded genus graphs, probabilistic approximation, embeddings, planar graphs |
| 1 | Sudipto Guha, Piotr Indyk, Andrew McGregor |
Sketching Information Divergences. |
COLT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat |
Efficient Computations of l1 and linfinity Rearrangement Distances. |
SPIRE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk |
Uncertainty principles, extractors, and explicit embeddings of l2 into l1. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
norm embeddings, extractors, uncertainty principles |
| 1 | Piotr Indyk |
Uncertainty Principles, Extractors, and Explicit Embeddings of L2 into L1. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Piotr Indyk |
Stable distributions, pseudorandom generators, embeddings, and data stream computation. |
J. ACM |
2006 |
DBLP DOI BibTeX RDF |
data streams, embeddings, dimensionality reduction, sketching, norms |
| 1 | Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk |
Low-Dimensional Embedding with Extra Information. |
Discrete & Computational Geometry |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Piotr Indyk |
Efficient algorithms for substring near neighbor problem. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos |
Embedding ultrametrics into low-dimensional spaces. |
Symposium on Computational Geometry |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithms, embedding, ultrametrics |
| 1 | Piotr Indyk, David P. Woodruff |
Polylogarithmic Private Approximations and Efficient Matching. |
TCC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Piotr Indyk |
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Piotr Indyk, Mihai Patrascu |
On the Optimality of the Dimensionality Reduction Method. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk, David P. Woodruff |
Polylogarithmic Private Approximations and Efficient Matching |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Piotr Indyk |
Linear-time encodable/decodable codes with near-optimal rate. |
IEEE Transactions on Information Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler |
Facility Location in Sublinear Time. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gereon Frahling, Piotr Indyk, Christian Sohler |
Sampling in dynamic data streams and applications. |
Symposium on Computational Geometry |
2005 |
DBLP DOI BibTeX RDF |
data structures, computational geometry, streaming algorithms |
| 1 | Piotr Indyk, David P. Woodruff |
Optimal approximations of the frequency moments of data streams. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
frequency moments, streaming algorithms |
| 1 | Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos |
Low-distortion embeddings of general metrics into the line. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
approxiation algorithms, metric embeddings |
| 1 | Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian |
Pattern Matching for Sets of Segments. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Orthogonal segments, Maximum coverage, Computational geometry, Pattern matching |
| 1 | Piotr Indyk |
Approximate Nearest Neighbor under edit distance via product metrics. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihai Badoiu, Piotr Indyk |
Fast approximate pattern matching with few indels via embeddings. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Piotr Indyk |
Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat |
Closest Pair Problems in Very High Dimensions. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Piotr Indyk |
Linear-Time List Decoding in Error-Free Settings: (Extended Abstract). |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk |
Low-dimensional embedding with extra information. |
Symposium on Computational Geometry |
2004 |
DBLP DOI BibTeX RDF |
angles, range graphs, approximation algorithms, metrics, distribution, graph embedding, order type |
| 1 | Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab S. Mirrokni |
Locality-sensitive hashing scheme based on p-stable distributions. |
Symposium on Computational Geometry |
2004 |
DBLP DOI BibTeX RDF |
p-stable distributions, locally sensitive hashing, sublinear algorithm, approximate nearest neighbor |
| 1 | Piotr Indyk |
Streaming Algorithms for Geometric Problems. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk |
Algorithms for dynamic geometric problems over data streams. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan |
Comparing Data Streams Using Hamming Norms (How to Zero In). |
IEEE Trans. Knowl. Data Eng. |
2003 |
DBLP DOI BibTeX RDF |
Data stream analysis, data reduction, approximate query processing, data structures and algorithms |
| 1 | Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian |
Combinatorial and Experimental Methods for Approximate Point Pattern Matching. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled, Piotr Indyk |
When Crossings Count - Approximating the Minimum Spanning Tree |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Piotr Indyk, Suresh Venkatasubramanian |
Approximate congruence in nearly linear time. |
Comput. Geom. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Julien Basch, Harish Devarajan, Piotr Indyk, Li Zhang 0001 |
Probabilistic Analysis for Discrete Attributes of Moving Points. |
Int. J. Comput. Geometry Appl. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Piotr Indyk |
Embeddings and non-approximability of geometric problems. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova |
Lower bounds for embedding edit distance into normed spaces. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk |
Better algorithms for high-dimensional proximity problems via asymmetric embeddings. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk, David P. Woodruff |
Tight Lower Bounds for the Distinct Elements Problem. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Piotr Indyk |
Linear time encodable and list decodable codes. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
adversarial noise model, linear time computation, expander graphs, list decoding, spectral partitioning |
| 1 | Piotr Indyk |
List-decoding in Linear Time |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani |
Maintaining Stream Statistics over Sliding Windows. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Engebretsen, Piotr Indyk, Ryan O'Donnell |
Derandomized dimensionality reduction with applications. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk |
Explicit constructions of selectors and related combinatorial structures, with applications. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani |
Maintaining stream statistics over sliding windows (extended abstract). |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss |
Histogramming Data Streams with Fast Per-Item Processing. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Piotr Indyk, Rina Panigrahy |
New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Graham Cormode, Piotr Indyk, Nick Koudas, S. Muthukrishnan |
Fast Mining of Massive Tabular Data via Approximate Distance Computations. |
ICDE |
2002 |
DBLP DOI BibTeX RDF |
Manhattan Distance, Lp norms, Data Mining, Clustering, Approximation, Euclidean Distance, Tabular Data |
| 1 | Piotr Indyk |
Approximate nearest neighbor algorithms for Frechet distance via product metrics. |
Symposium on Computational Geometry |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Taher H. Haveliwala, Aristides Gionis, Dan Klein, Piotr Indyk |
Evaluating strategies for similarity search on the web. |
WWW |
2002 |
DBLP DOI BibTeX RDF |
open directory project, related pages, evaluation, search, similarity search |
| 1 | Nitin Thaper, Sudipto Guha, Piotr Indyk, Nick Koudas |
Dynamic multidimensional histograms. |
SIGMOD Conference |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan |
Comparing Data Streams Using Hamming Norms (How to Zero In). |
VLDB |
2002 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Piotr Indyk |
Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss |
Near-optimal sparse fourier representations via sampling. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihai Badoiu, Sariel Har-Peled, Piotr Indyk |
Approximate clustering via core-sets. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna C. Gilbert, Sudipto Guha, Piotr Indyk, Yannis Kotidis, S. Muthukrishnan, Martin Strauss |
Fast, small-space algorithms for approximate histogram maintenance. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang |
Finding Interesting Associations without Support Pruning. |
IEEE Trans. Knowl. Data Eng. |
2001 |
DBLP DOI BibTeX RDF |
min hashing, Data mining, association rules, locality sensitive hashing, similarity metric |
| 1 | Yair Bartal, Moses Charikar, Piotr Indyk |
On page migration and other relaxed task systems. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet |
Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk |
A Small Approximately Min-Wise Independent Family of Hash Functions. |
J. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")