2252 search results - page 41 / 451 » Improving Random Forests |
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
We exhibit an explicit function f : {0,1}n {0,1} that can be computed by a nondeterministic number-on-forehead protocol communicating O(logn) bits, but that requires n(1) bits of...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
ICML
2009
IEEE
14 years 2 months ago
2009
IEEE
In real sequence labeling tasks, statistics of many higher order features are not sufficient due to the training data sparseness, very few of them are useful. We describe Sparse H...
SIBGRAPI
2006
IEEE
14 years 2 months ago
2006
IEEE
Traditional mesh segmentation methods normally operate on geometrical models with no image information. On the other hand, 2D image-based mesh generation and segmentation counterp...
WEA
2010
Springer
14 years 1 months ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...