762 search results - page 4 / 153 » Intercode Regular Languages |
100
click to vote
DLT
2009
14 years 9 months ago
2009
Abstract. We consider algorithms for approximating context
94
Voted
FOSSACS
2011
Springer
14 years 3 months ago
2011
Springer
We describe a general decomposition mechanism to express the derivation relation of a word rewriting system R as the composition of a (regular) substitution followed by the derivat...
120
click to vote
JMLR
2012
13 years 2 months ago
2012
We consider the minimization of a smooth loss with trace-norm regularization, which is a natural objective in multi-class and multitask learning. Even though the problem is convex...
86
Voted
ATVA
2009
Springer
15 years 3 months ago
2009
Springer
We present specification languages that naturally capture exactly the regular and -regular properties that are stutter invariant. Our specification languages are variants of the cl...
85
Voted
ADBIS
2009
Springer
15 years 6 months ago
2009
Springer
We propose linear systems of hedge language equations (LSH) as a formalism to represent regular hedge languages. These linear systems are suitable for several computations in the a...