121 search results - page 9 / 25 » Algorithms for optimal dyadic decision trees |
WG
1998
Springer
14 years 4 days ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
ICASSP
2011
IEEE
12 years 11 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...
WOB
2004
13 years 9 months ago
2004
ABSTRACT. The computationally challenging problem of reconstructing the phylogeny of a set of contemporary data, such as DNA sequences or morphological attributes, was treated by a...
INFORMATICALT
2010
13 years 2 months ago
2010
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
CEC
2010
IEEE
13 years 9 months ago
2010
IEEE
Inspired originally by the Learnable Evolution Model(LEM) [5], we investigate LEM(ID3), a hybrid of evolutionary search with ID3 decision tree learning. LEM(ID3) involves interleav...