481 search results - page 90 / 97 » Learning relational probability trees |
TSD
2004
Springer
14 years 24 days ago
2004
Springer
A significant challenge in Text-to-Speech (TtS) synthesis is the formulation of the prosodic structures (phrase breaks, pitch accents, phrase accents and boundary tones) of uttera...
JMLR
2008
13 years 7 months ago
2008
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
JMLR
2010
13 years 2 months ago
2010
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
CSCL
2008
13 years 7 months ago
2008
: This paper presents a conceptual analysis of the technological dimensions related to the operationalization of CSCL macro-scripts. CSCL scripts are activity models that aim at en...