%0 Generic %1 rensample %A Ren, Wenbo %A Liu, Jia (Kevin) %A Shroff, Ness %D 2019 %K bounds complexity neurips2019 %P 10014-10024 %T On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons %U http://papers.nips.cc/paper/9192-on-sample-complexity-upper-and-lower-bounds-for-exact-ranking-from-noisy-comparisons

@conference{rensample, added-at = {2019-11-20T15:18:21.000+0100}, author = {Ren, Wenbo and Liu, Jia (Kevin) and Shroff, Ness}, biburl = {https://www.bibsonomy.org/bibtex/2efa19ff0a22c0795c07e588df568ce4e/kirk86}, description = {On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons}, interhash = {5997f5c5a5e06ad9ba3879a6cb607d6a}, intrahash = {efa19ff0a22c0795c07e588df568ce4e}, keywords = {bounds complexity neurips2019}, pages = {10014-10024}, timestamp = {2019-11-20T15:18:21.000+0100}, title = {On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons}, type = {misc}, url = {http://papers.nips.cc/paper/9192-on-sample-complexity-upper-and-lower-bounds-for-exact-ranking-from-noisy-comparisons}, year = 2019 }