518 search results - page 37 / 104 » Beating a Random Assignment |
121
Voted
SIGKDD
2010
14 years 9 months ago
2010
A number of times when using cross-validation (CV) while trying to do classification/probability estimation we have observed surprisingly low AUC's on real data with very few...
171
Voted
BMCBI
2011
14 years 9 months ago
2011
Background: Automated, image based high-content screening is a fundamental tool for discovery in biological science. Modern robotic fluorescence microscopes are able to capture th...
117
click to vote
MOBIHOC
2006
ACM
16 years 2 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
113
click to vote
IJCAI
2007
15 years 3 months ago
2007
Many methods, including supervised and unsupervised algorithms, have been developed for extractive document summarization. Most supervised methods consider the summarization task ...
146
click to vote
RSA
2010
15 years 26 days ago
2010
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...