Sciweavers

1679 search results - page 107 / 336
» Strong order equivalence
Sort
View
ENTCS
2008
71views more  ENTCS 2008»
13 years 10 months ago
An Inverse Method for Parametric Timed Automata
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...
Étienne André, Thomas Chatain, Laure...
IPL
2008
147views more  IPL 2008»
13 years 10 months ago
Streaming tree automata
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...
Olivier Gauwin, Joachim Niehren, Yves Roos
JSAT
2008
89views more  JSAT 2008»
13 years 10 months ago
Towards a Classification of Hamiltonian Cycles in the 6-Cube
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...
Yury Chebiryak, Daniel Kroening
JSYML
2006
85views more  JSYML 2006»
13 years 10 months ago
On PAC and bounded substructures of a stable structure
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...
Anand Pillay, Dominika Polkowska
PAIRING
2010
Springer
133views Cryptology» more  PAIRING 2010»
13 years 8 months ago
Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree
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...
Sorina Ionica, Antoine Joux