I agree that this site is using cookies. You can find further informations here.
X
Indyk, Piotr
255  results:
Search for persons X
?
1

Addressing Feature Suppression in Unsupervised Visual Repre..:

, In: 2023 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV),
Li, Tianhong ; Fan, Lijie ; Yuan, Yuan... - p. 1411-1420 , 2023
Link: https://doi.org/10.1109/..
 
?
2

Optimal (Euclidean) Metric Compression:

Indyk, Piotr ; Wagner, Tal
SIAM Journal on Computing.  51 (2022)  3 - p. 467-491 , 2022
Link: https://doi.org/10.1137/..
 
?
3

Targeted Supervised Contrastive Learning for Long-Tailed Re..:

, In: 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR),
Li, Tianhong ; Cao, Peng ; Yuan, Yuan... - p. 6908-6918 , 2022
Link: https://doi.org/10.1109/..
 
?
4

Composable core-sets for determinant maximization problems ..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Indyk, Piotr ; Mahabadi, Sepideh ; Gharan, Shayan Oveis. - p. 1675-1694 , 2020
Link: https://dl.acm.org/doi/1..
 
?
5

Approximation Algorithms for Low-Distortion Embeddings into..:

Sidiropoulos, Anastasios ; Badoiu, Mihai ; Dhamdhere, Kedar...
SIAM Journal on Discrete Mathematics.  33 (2019)  1 - p. 454-473 , 2019
Link: https://doi.org/10.1137/..
 
?
6

Tight Trade-offs for the Maximum k-Coverage Problem in the ..:

, In: Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,
Indyk, Piotr ; Vakilian, Ali - p. 200-217 , 2019
Link: https://dl.acm.org/doi/1..
 
?
7

Fast millimeter wave beam alignment:

, In: Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication,
Hassanieh, Haitham ; Abari, Omid ; Rodriguez, Michael... - p. 432-445 , 2018
Link: https://dl.acm.org/doi/1..
 
?
8

Set Cover in Sub-linear Time:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Indyk, Piotr ; Mahabadi, Sepideh ; Rubinfeld, Ronitt.. - p. 2467-2486 , 2018
Link: https://doi.org/10.1137/..
 
?
9

Set cover in sub-linear time:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Indyk, Piotr ; Mahabadi, Sepideh ; Rubinfeld, Ronitt.. - p. 2467-2486 , 2018
Link: https://dl.acm.org/doi/1..
 
?
10

Edit Distance Cannot Be Computed in Strongly Subquadratic T..:

Backurs, Arturs ; Indyk, Piotr
SIAM Journal on Computing.  47 (2018)  3 - p. 1087-1097 , 2018
Link: https://doi.org/10.1137/..
 
?
11

44th International Colloquium on Automata, Languages, and P.. 

ICALP 2017, Warsaw, Poland, July 10-14, 2017  LIPIcs - Leibniz international proceedings in informatics ; vol. 80
Chatzigiannakis, Ioannis ; Indyk, Piotr ; Kuhn, Fabian. , July 2017
Link: https://doi.org/10.4230/..
 
?
12

Nearly Optimal Deterministic Algorithm for Sparse Walsh-Had..:

Cheraghchi, Mahdi ; Indyk, Piotr
ACM Transactions on Algorithms.  13 (2017)  3 - p. 1-36 , 2017
Link: https://doi.org/10.1145/..
 
?
13

Nearly Optimal Deterministic Algorithm for Sparse Walsh-Had..:

Cheraghchi, Mahdi ; Indyk, Piotr
ACM Transactions on Algorithms (TALG).  13 (2017)  3 - p. 1-36 , 2017
Link: https://dl.acm.org/doi/1..
 
?
14

Near-optimal (euclidean) metric compression:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,
Indyk, Piotr ; Wagner, Tal - p. 710-723 , 2017
Link: https://dl.acm.org/doi/1..
 
?
15

Better approximations for tree sparsity in nearly-linear ti..:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,
Backurs, Arturs ; Indyk, Piotr ; Schmidt, Ludwig - p. 2215-2229 , 2017
Link: https://dl.acm.org/doi/1..
 
1-15