Sciweavers

4218 search results - page 700 / 844
» Complete sets of cooperations
Sort
View
INTERSPEECH
2010
13 years 4 months ago
A classifier-based target cost for unit selection speech synthesis trained on perceptual data
Our goal is to automatically learn a perceptually-optimal target cost function for a unit selection speech synthesiser. The approach we take here is to train a classifier on human...
Volker Strom, Simon King
JAR
2010
98views more  JAR 2010»
13 years 4 months ago
Proof-Guided Test Selection from First-Order Specifications with Equality
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
Delphine Longuet, Marc Aiguier, Pascale Le Gall
JAR
2010
95views more  JAR 2010»
13 years 4 months ago
Equivariant Unification
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...
James Cheney
JMLR
2010
157views more  JMLR 2010»
13 years 4 months ago
Why are DBNs sparse?
Real stochastic processes operating in continuous time can be modeled by sets of stochastic differential equations. On the other hand, several popular model families, including hi...
Shaunak Chatterjee, Stuart Russell
JSYML
2010
120views more  JSYML 2010»
13 years 4 months ago
Universally measurable subgroups of countable index
We prove that any countable index, universally measurable subgroup of a Polish group is open. By consequence, any universally measurable homomorphism from a Polish group into the i...
Christian Rosendal