2252 search results - page 215 / 451 » Improving Random Forests |
146
click to vote
STOC
1996
ACM
15 years 8 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
143
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Analysis of complex samples with tandem mass spectrometry (MS/MS) has become routine in proteomic research. However, validation of database search results creates a bo...
131
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
119
click to vote
AI
2005
Springer
15 years 3 months ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
144
click to vote
TCOM
2010
15 years 2 months ago
2010
—Physical (PHY) layer cooperation in a wireless network allows neighboring nodes to share their communication resources in order to create a virtual antenna array by means of dis...