<--- Back to Details
First PageDocument Content
Analysis of algorithms / Algorithm / FisherYates shuffle / Crowdsourcing / Randomized algorithm / Time complexity / Big O notation
Date: 2016-07-30 12:22:15
Analysis of algorithms
Algorithm
FisherYates shuffle
Crowdsourcing
Randomized algorithm
Time complexity
Big O notation

The Importance of Being Expert: Efficient Max-Finding in Crowdsourcing For reviewing purposes only. Please do not distribute! Aris Anagnostopoulos Luca Becchetti

Add to Reading List

Source URL: matteo.rionda.to

Download Document from Source Website

File Size: 933,92 KB

Share Document on Facebook

Similar Documents