1052 search results - page 46 / 211 » The Regular Real-Time Languages |
115
Voted
INTERSPEECH
2010
14 years 10 months ago
2010
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 ...
104
click to vote
MLG
2007
Springer
15 years 9 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
171
Voted
CRYPTO
2012
Springer
13 years 6 months ago
2012
Springer
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....
133
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
122
Voted
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type syst...