Searching for authors named Piotr Indyk – sorted by Relevance.
-
unknown title
- Piotr Indyk MIT indyk@(email omitted); 1 Introduction In this paper we present explicit
- Add To MetaCart
-
Better algorithms for high-dimensional proximity problems via asymmetric embeddings
- Better Algorithms for High-dimensional Proximity Problems via Asymmetric Embeddings Piotr Indyk
- Cited by 11 (1 self) – Add To MetaCart
-
Algorithms for dynamic geometric problems over data streams
- Algorithms for Dynamic Geometric Problems over DataStreams Piotr Indyk \Lambda CSAIL MIT 1
- Cited by 16 (1 self) – Add To MetaCart
-
Dimensionality reduction techniques for proximity problems
- Dimensionality Reduction Techniques for Proximity Problems piotr indyk \Lambda stanford
- Cited by 14 (3 self) – Add To MetaCart
-
Explicit constructions for compressed sensing of sparse signals
- Explicit Constructions for Compressed Sensing of Sparse Signals 1 Introduction Piotr Indyk MIT
- Cited by 3 (1 self) – Add To MetaCart
-
Near-Optimal Sparse Recovery in the L1 norm
- Near-Optimal Sparse Recovery in the L1 norm Piotr Indyk MIT indyk@(email omitted); Milan Ruˇzić ITU
- Add To MetaCart
-
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces
- A Sublinear Time Approximation Scheme for Clustering in Metric Spaces piotr indyk stanford
- Cited by 28 (1 self) – Add To MetaCart
-
Sublinear Time Algorithms for Metric Space Problems
- Sublinear Time Algorithms for Metric Space Problems piotr indyk Computer Science Department
- Cited by 59 (2 self) – Add To MetaCart
-
Tight lower bounds for the distinct elements problem
- Tight Lower Bounds for the Distinct Elements Problem Piotr Indyk MIT indyk
- Cited by 17 (4 self) – Add To MetaCart
-
Algorithmic applications of low-distortion geometric embeddings
- Algorithmic Applications of Low-distortion Geometric Embeddings Piotr Indyk MIT Low
- Cited by 81 (5 self) – Add To MetaCart

