84 search results - page 16 / 17 » Efficient Enumeration of Regular Languages |
119
Voted
TNN
2008
15 years 3 months ago
2008
Abstract-- A major drawback of artificial neural networks (ANNs) is their black-box character. This is especially true for recurrent neural networks (RNNs) because of their intrica...
216
Voted
POPL
2010
ACM
16 years 1 months ago
2010
ACM
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
145
Voted
ANCS
2007
ACM
15 years 7 months ago
2007
ACM
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
209
Voted
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
Several recent papers have focused on OLAP over imprecise data, where each fact can be a region, instead of a point, in a multidimensional space. They have provided a multiple-wor...
159
Voted
DLT
2010
15 years 5 months ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...