Sciweavers

3145 search results - page 442 / 629
» Algebraic Linear Orderings
Sort
View
ACSD
2008
IEEE
135views Hardware» more  ACSD 2008»
15 years 8 months ago
Synthesis of Petri nets from infinite partial languages
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...
Robin Bergenthum, Jörg Desel, Robert Lorenz, ...
CSL
2008
Springer
15 years 8 months ago
Quantified Positive Temporal Constraints
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
Witold Charatonik, Michal Wrona
EUROCRYPT
2008
Springer
15 years 8 months ago
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mix-nets, whic...
Jens Groth, Yuval Ishai
DEON
2010
Springer
15 years 8 months ago
A Dyadic Operator for the Gradation of Desirability
We propose a normal modal deontic logic based on a dyadic operator, similar in structure to the temporal "until". By bringing significant expressiveness to the logic, it ...
Guillaume Piolle
171
Voted
FPL
2008
Springer
120views Hardware» more  FPL 2008»
15 years 8 months ago
An FPGA-based implementation of the MINRES algorithm
Due to continuous improvements in the resources available on FPGAs, it is becoming increasingly possible to accelerate floating point algorithms. The solution of a system of linea...
David Boland, George A. Constantinides