Sciweavers

1068 search results - page 121 / 214
» Extremely randomized trees
Sort
View
BMCBI
2010
118views more  BMCBI 2010»
13 years 10 months ago
From learning taxonomies to phylogenetic learning: Integration of 16S rRNA gene data into FAME-based bacterial classification
Background: Machine learning techniques have shown to improve bacterial species classification based on fatty acid methyl ester (FAME) data. Nonetheless, FAME analysis has a limit...
Bram Slabbinck, Willem Waegeman, Peter Dawyndt, Pa...
IS
2010
13 years 8 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
COMPGEOM
2010
ACM
14 years 3 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
IPPS
2007
IEEE
14 years 4 months ago
Analyzing the Scalability of Graph Algorithms on Eldorado
The Cray MTA-2 system provides exceptional performance on a variety of sparse graph algorithms. Unfortunately, it was an extremely expensive platform. Cray is preparing an Eldorad...
Keith D. Underwood, Megan Vance, Jonathan W. Berry...
IJCNN
2006
IEEE
14 years 4 months ago
Ensemble of Neural Network Emulations for Climate Model Physics: The Impact on Climate Simulations
—A new application of the NN ensemble approach is presented. It is applied to NN emulations of model physics in complex numerical climate models, and aimed at improving the accur...
Michael S. Fox-Rabinovitz, Vladimir M. Krasnopolsk...