2252 search results - page 211 / 451 » Improving Random Forests |
132
click to vote
JCC
2008
15 years 3 months ago
2008
: We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowled...
131
click to vote
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—By exploiting reception diversity of wireless network links, researchers have shown that opportunistic routing can improve network performance significantly over traditional ro...
259
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
139
click to vote
CCS
2009
ACM
15 years 10 months ago
2009
ACM
Peer-to-peer approaches to anonymous communication promise to eliminate the scalability concerns and central vulnerability points of current networks such as Tor. However, the P2P...
135
Voted
ISBRA
2009
Springer
15 years 10 months ago
2009
Springer
Cheng and Church proposed a greedy deletion-addition algorithm to find a given number of k biclusters, whose mean squared residues (MSRs) are below certain thresholds and the miss...