Sciweavers

131 search results - page 4 / 27
» Leftist Canonical Ordering
Sort
View
SIAMCO
2008
161views more  SIAMCO 2008»
13 years 9 months ago
Controllability and Observability of Second Order Descriptor Systems
We analyze controllability and observability conditions for second order descriptor systems and show how the classical conditions for first order systems can be generalized to this...
Philip Losse, Volker Mehrmann
ICONIP
1998
13 years 11 months ago
An Application of ELISA to Perfect Hashing with Deterministic Ordering
This paper describes a practical application of a novel terminal attractor algorithm to the construction of Perfect Hash Functions (PHF) for a prede ned set of keys. The proposed ...
Monica Bianchini, Stefano Fanelli, Marco Gori
RTA
1993
Springer
14 years 1 months ago
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ â...
Jordi Levy, Jaume Agustí-Cullell
APAL
2005
154views more  APAL 2005»
13 years 9 months ago
A Sahlqvist theorem for distributive modal logic
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...
Mai Gehrke, Hideo Nagahashi, Yde Venema
EUROCRYPT
2000
Springer
14 years 1 months ago
A NICE Cryptanalysis
We present a chosen-ciphertext attack against both NICE cryptosystems. These two cryptosystems are based on computations in the class group of non-maximal imaginary orders. More pr...
Éliane Jaulmes, Antoine Joux