Sciweavers

321 search results - page 25 / 65
» Modeling liaison in French by using decision trees
Sort
View
INTERSPEECH
2010
13 years 3 months ago
Autoregressive clustering for HMM speech synthesis
The autoregressive HMM has been shown to provide efficient parameter estimation and high-quality synthesis, but in previous experiments decision trees derived from a non-autoregre...
Matt Shannon, William Byrne
CASDMKM
2004
Springer
147views Data Mining» more  CASDMKM 2004»
14 years 1 months ago
Data Set Balancing
This paper conducts experiments with three skewed data sets, seeking to demonstrate problems when skewed data is used, and identifying counter problems when data is balanced. The b...
David L. Olson
CSCLP
2008
Springer
13 years 10 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
PKDD
2005
Springer
95views Data Mining» more  PKDD 2005»
14 years 2 months ago
Ensembles of Balanced Nested Dichotomies for Multi-class Problems
Abstract. A system of nested dichotomies is a hierarchical decomposition of a multi-class problem with c classes into c − 1 two-class problems and can be represented as a tree st...
Lin Dong, Eibe Frank, Stefan Kramer
CIE
2006
Springer
14 years 6 days ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante