Sciweavers

762 search results - page 3 / 153
» Intercode Regular Languages
Sort
View
INTERSPEECH
2010
13 years 2 months ago
Regularized-MLLR speaker adaptation for computer-assisted language learning system
In this paper, we propose a novel speaker adaptation technique, regularized-MLLR, for Computer Assisted Language Learning (CALL) systems. This method uses a linear combination of ...
Dean Luo, Yu Qiao, Nobuaki Minematsu, Yutaka Yamau...
CRYPTO
2012
Springer
327views Cryptology» more  CRYPTO 2012»
11 years 9 months ago
Functional Encryption for Regular Languages
We provide a functional encryption system that supports functionality for regular languages. In our system a secret key is associated with a Deterministic Finite Automata (DFA) M....
Brent Waters
COLING
2010
13 years 2 months ago
Varro: An Algorithm and Toolkit for Regular Structure Discovery in Treebanks
The Varro toolkit is a system for identifying and counting a major class of regularity in treebanks and annotated natural language data in the form of treestructures: frequently r...
Scott Martens
AFL
2011
98views more  AFL 2011»
12 years 7 months ago
Accepting Networks of Evolutionary Processors with Subregular Filters
In this paper, we propose a new variant of Accepting Networks of Evolutionary Processors, in which the operations can be applied only arbitrarily to the words, while the filters ...
Florin Manea, Bianca Truthe
SOFSEM
2012
Springer
12 years 2 months ago
Iterated Hairpin Completions of Non-crossing Words
Abstract. Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or m...
Lila Kari, Steffen Kopecki, Shinnosuke Seki