513 search results - page 100 / 103 » Finitely Based, Finite Sets of Words |
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
EH
1999
IEEE
1999
IEEE
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
13 years 11 months ago
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
ESWS
2008
Springer
13 years 9 months ago
2008
Springer
Context-awareness is a highly desired feature across several application domains. Semantic Web Services (SWS) technologies address context-adaptation by enabling the automatic disc...
ECCC
2006
13 years 7 months ago
2006
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
DLT
2010
13 years 8 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...