4 citations · 6 across the 9 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016
Competitive analysis of the top-K ranking problem
Xi Chen, Sivakanth Gopi, Jieming Mao +1
Motivated by applications in recommender systems, web search, social choice and crowdsourcing, we consider the problem of identifying the set of top items from noisy pairwise c…
cs.DS2016
Parallel Algorithms for Select and Partition with Noisy Comparisons
Mark Braverman, Jieming Mao, S. Matthew Weinberg
We consider the problem of finding the highest element in a totally ordered set of elements (select), and partitioning a totally ordered set into the top and botto…