Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence.

N. Shah, S. Balakrishnan, J. Bradley, A. Parekh, K. Ramchandran, and M. Wainwright. J. Mach. Learn. Res., (2016)

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.

Hildegard Parekh

Niranjan Parekh

Abhay Devasthale

Abhay Pada Datta

Other publications of authors with the same name

When is it Better to Compare than to Score?N. Shah, S. Balakrishnan, J. Bradley, A. Parekh, K. Ramchandran, and M. Wainwright. CoRR, (2014)Sharing Network ResourcesA. Parekh, and J. Walrand. Synthesis Lectures on Communication Networks Morgan & Claypool Publishers, (2014)Incentive mechanism for DTN-based message delivery services.K. Sugiyama, T. Kubo, A. Tagami, and A. Parekh. GLOBECOM, page 3108-3113. IEEE, (2013)Spectrum sharing for unlicensed bands.R. Etkin, A. Parekh, and D. Tse. IEEE J. Sel. Areas Commun., 25 (3): 517-528 (2007)Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence.N. Shah, S. Balakrishnan, J. Bradley, A. Parekh, K. Ramchandran, and M. Wainwright. J. Mach. Learn. Res., (2016)A VoD System for Massively Scaled, Heterogeneous Environments: Design and Implementation.K. Lee, L. Yan, A. Parekh, and K. Ramchandran. MASCOTS, page 1-10. IEEE Computer Society, (2013)An Adaptive Multi-channel P2P Video-on-Demand System using Plug-and-Play HelpersH. Zhang, M. Chen, A. Parekh, and K. Ramchandran. CoRR, (2010)The Square Root Agreement Rule for Incentivizing Truthful Feedback on Online Platforms.V. Kamble, N. Shah, D. Marn, A. Parekh, and K. Ramchandran. Manag. Sci., 69 (1): 377-403 (January 2023)Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence.N. Shah, S. Balakrishnan, J. Bradley, A. Parekh, K. Ramchandran, and M. Wainwright. AISTATS, volume 38 of JMLR Workshop and Conference Proceedings, JMLR.org, (2015)Matching Observations to Distributions: Efficient Estimation via Sparsified Hungarian Algorithm.S. Chewi, F. Yang, A. Ghosh, A. Parekh, and K. Ramchandran. Allerton, page 368-375. IEEE, (2019)

BibSonomy

Disambiguation of "Parekh, Abhay"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence.

Please choose a person to relate this publication to

Hildegard Parekh

Niranjan Parekh

Abhay Devasthale

Abhay Pada Datta

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Parekh, Abhay"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence.

Please choose a person to relate this publication to

Hildegard Parekh

Niranjan Parekh

Abhay Devasthale

Abhay Pada Datta

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence.