Sciweavers

3653 search results - page 68 / 731
» On Recognizable Timed Languages
Sort
View
RP
2010
Springer
118views Control Systems» more  RP 2010»
14 years 7 months ago
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
Zdenek Sawa
ICASSP
2011
IEEE
14 years 1 months ago
Distributed training of large scale exponential language models
Shrinkage-based exponential language models, such as the recently introduced Model M, have provided significant gains over a range of tasks [1]. Training such models requires a l...
Abhinav Sethy, Stanley F. Chen, Bhuvana Ramabhadra...
JMLR
2012
13 years 9 days ago
SpeedBoost: Anytime Prediction with Uniform Near-Optimality
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
Alexander Grubb, Drew Bagnell
CSL
2009
Springer
15 years 4 months ago
Craig Interpolation for Linear Temporal Languages
We study Craig interpolation for fragments and extensions of propositional linear temporal logic (PLTL). We consider various fragments of PLTL obtained by restricting the set of te...
Amélie Gheerbrant, Balder ten Cate
VLDB
1992
ACM
98views Database» more  VLDB 1992»
15 years 1 months ago
Updates in a Rule-Based Language for Objects
The integration of object-oriented concepts into deductive databases has been investigated for a certain time now. Various approaches to incorporate updates into deduction have be...
Michael Kramer, Georg Lausen, Gunter Saake