Sciweavers

513 search results - page 47 / 103
» Finitely Based, Finite Sets of Words
Sort
View
SIAMSC
2008
131views more  SIAMSC 2008»
14 years 11 months ago
Gramian-Based Model Reduction for Data-Sparse Systems
Model order reduction (MOR) is common in simulation, control and optimization of complex dynamical systems arising in modeling of physical processes and in the spatial discretizati...
Ulrike Baur, Peter Benner
ACL
1998
15 years 1 months ago
Automatic Acquisition of Hierarchical Transduction Models for Machine Translation
We describe a method for the fully automatic learning of hierarchical finite state translation models. The input to the method is transcribed speech utterances and their correspon...
Hiyan Alshawi, Srinivas Bangalore, Shona Douglas
JALC
2008
72views more  JALC 2008»
14 years 11 months ago
Maximal Error-Detecting Capabilities of Formal Languages
A combinatorial channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability&q...
Stavros Konstantinidis, Pedro V. Silva
LREC
2010
159views Education» more  LREC 2010»
15 years 1 months ago
Towards Optimal TTS Corpora
Unit selection text-to-speech systems currently produce very natural synthesized phrases by concatenating speech segments from a large database. Recently, increasing demand for de...
Didier Cadic, Cédric Boidin, Christophe d'A...
TCS
2008
14 years 11 months ago
Kernel methods for learning languages
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri