2252 search results - page 74 / 451 » Improving Random Forests |
149
click to vote
PODS
2012
ACM
13 years 4 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
160
click to vote
JSS
2010
15 years 26 days ago
2010
Random testing is not only a useful testing technique in itself, but also plays a core role in many other testing methods. Hence, any significant improvement to random testing ha...
103
click to vote
DAWAK
2005
Springer
15 years 8 months ago
2005
Springer
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...
113
click to vote
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
117
click to vote
ISCI
2008
15 years 2 months ago
2008
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...