234 search results - page 46 / 47 » On Quasi-Products of Tree Automata |
4OR
2010
14 years 10 months ago
2010
s (from Seminario Dottorato's web page) 3 Notes of the seminars 9 Nicola Mazzari, A note on Grothendieck fundamental group . . . . . . . . . . . . . . 9 Marco Formentin, Infor...
187
click to vote
SIGMOD
2009
ACM
15 years 11 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...
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
TCC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...