1679 search results - page 107 / 336 » Strong order equivalence |
122
click to vote
ENTCS
2008
15 years 5 months ago
2008
Given a timed automaton with parametric timings, our objective is to describe a procedure for deriving constraints on the parametric timings in order to ensure that, for each valu...
178
click to vote
IPL
2008
15 years 5 months ago
2008
Streaming validation and querying of XML documents are often based on automata for tree-like structures. We propose a new notion of streaming tree automata in order to unify the t...
160
click to vote
JSAT
2008
15 years 5 months ago
2008
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representati...
123
click to vote
JSYML
2006
15 years 5 months ago
2006
We introduce and study the notions of a PAC substructure of a stable structure, and a bounded substructure of an arbitrary substructure, generalizing [8]. We give precise definiti...
149
click to vote
PAIRING
2010
Springer
15 years 3 months ago
2010
Springer
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implem...