518 search results - page 35 / 104 » Beating a Random Assignment |
202
click to vote
ICIP
2010
IEEE
15 years 13 days ago
2010
IEEE
The Random forest classifier comes to be the working horse for visual recognition community. It predicts the class label of an input data by aggregating the votes of multiple tree...
121
click to vote
ASPDAC
2009
ACM
15 years 9 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
115
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper investigates randomization and replication as strategies to achieve reliable performance in disk arrays targeted for video-on-demand (VoD) workloads. A disk array can p...
120
click to vote
ICML
2004
IEEE
16 years 3 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
109
click to vote
STOC
2010
ACM
15 years 2 months ago
2010
ACM
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...