1068 search results - page 214 / 214 » Extremely randomized trees |
CORR
2012
Springer
12 years 1 months ago
2012
Springer
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
SIAMCOMP
2008
13 years 5 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
PRIB
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Supervised classifiers require manually labeled training samples to classify unlabeled objects. Active Learning (AL) can be used to selectively label only “ambiguous...