2252 search results - page 94 / 451 » Improving Random Forests |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
SIGMETRICS
2010
ACM
14 years 29 days ago
2010
ACM
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may s...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
FOCS
2000
IEEE
14 years 16 days ago
2000
IEEE
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...