Sciweavers

1068 search results - page 52 / 214
» Extremely randomized trees
Sort
View
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
14 years 1 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
MCS
2010
Springer
13 years 10 months ago
Choosing Parameters for Random Subspace Ensembles for fMRI Classification
Abstract. Functional magnetic resonance imaging (fMRI) is a noninvasive and powerful method for analysis of the operational mechanisms of the brain. fMRI classification poses a sev...
Ludmila I. Kuncheva, Catrin O. Plumpton
CCCG
2010
13 years 10 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
SMA
2008
ACM
396views Solid Modeling» more  SMA 2008»
13 years 8 months ago
Fast mesh segmentation using random walks
3D mesh models are now widely available for use in various applications. The demand for automatic model analysis and understanding is ever increasing. Mesh segmentation is an impo...
Yu-Kun Lai, Shi-Min Hu, Ralph R. Martin, Paul L. R...
JMLR
2010
145views more  JMLR 2010»
13 years 3 months ago
Parallelizable Sampling of Markov Random Fields
Markov Random Fields (MRFs) are an important class of probabilistic models which are used for density estimation, classification, denoising, and for constructing Deep Belief Netwo...
James Martens, Ilya Sutskever