219 search results - page 21 / 44 » Optimal dyadic decision trees |
ICALP
1995
Springer
14 years 2 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
PR
2010
13 years 8 months ago
2010
The performance of m-out-of-n bagging with and without replacement in terms of the sampling ratio (m/n) is analyzed. Standard bagging uses resampling with replacement to generate ...
HIS
2008
13 years 12 months ago
2008
Classification in imbalanced domains is a recent challenge in machine learning. We refer to imbalanced classification when data presents many examples from one class and few from ...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
This paper proposes a technique for constructing independent parameter tying structures of mean and variance in HMMbased speech synthesis. Conventionally, mean and variance parame...
IFIP
2005
Springer
14 years 3 months ago
2005
Springer
In this paper we analyze the electricity portfolio problem of a big consumer in a multi-stage stochastic programming framework. Stochasticity enters the model via the uncertain spo...