申请试用
HOT
登录
注册
 
So Who Won?Dynamic Max Discovery with the Crowd

So Who Won?Dynamic Max Discovery with the Crowd

da仔
/
发布于
/
1760
人观看
In this paper, we focus on one such function, maximum, that finds the highest ranked object or tuple in a set. In particularm we study two problems: given a set of votes (pairwise comparisons among objects), how do we select the maximum? And how do we improve our estimate by requesting additional votes? We show that in a crowdsourcing DB system, the optimal solution to both problems is NP-Hard. We then provide heuristic functions to select the maximum given evidence, and to select additional votes.
17 点赞
6 收藏
0下载
相关文档
确认
3秒后跳转登录页面
去登陆