( en | de | ru )

 

Disambiguation of "Venkat, Rakesh"

Author of the publication

copydeleteadd this publication to your clipboard
A refined approximation for Euclidean k-means.

, , , , and . Inf. Process. Lett., (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Venkat Chandar

Rakesh Pandey

Rakesh Kumar

Rakesh Sohal

Rakesh Bakshi

 

Other publications of authors with the same name

Hypergraph Two-Coloring in the Streaming Model., , and . CoRR, (2015)BullsEye : Scalable and Accurate Approximation Framework for Cache Miss Calculation., , , , and . ACM Trans. Archit. Code Optim., 20 (1): 2:1-2:28 (March 2023)A refined approximation for Euclidean k-means., , , , and . Inf. Process. Lett., (2022)On Fortification of General Games., , , and . Electron. Colloquium Comput. Complex., (2015)Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces., and . APPROX-RANDOM, volume 81 of LIPIcs, page 21:1-21:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Planted Models for k-Way Edge and Vertex Expansion., and . FSTTCS, volume 150 of LIPIcs, page 23:1-23:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Embedding approximately low-dimensional ℓ22 metrics into ℓ1., , and . CoRR, (2015)A Refined Approximation for Euclidean k-Means., , , , and . CoRR, (2021)On Fortification of Projection Games., , , and . APPROX-RANDOM, volume 40 of LIPIcs, page 497-511. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery., and . ICALP, volume 107 of LIPIcs, page 101:1-101:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)