Sciweavers

2517 search results - page 106 / 504
» Specifying Weak Sets
Sort
View
COMBINATORICS
1999
82views more  COMBINATORICS 1999»
15 years 5 months ago
On Highly Closed Cellular Algebras and Highly Closed Isomorphisms
We define and study m-closed cellular algebras (coherent configurations) and m-isomorphisms of cellular algebras which can be regarded as mth approximations of Schurian algebras (...
Sergei Evdokimov, Ilia N. Ponomarenko
TCS
1998
15 years 5 months ago
Axiomatisation of Functional Dependencies in Incomplete Relations
Incomplete relations are relations which contain null values, whose meaning is \value is at present unknown". Such relations give rise to two types of functional dependency (...
Mark Levene, George Loizou
SIAMCO
2002
86views more  SIAMCO 2002»
15 years 5 months ago
On the Observability and Detectability of Continuous-Time Markov Jump Linear Systems
The paper introduces a new detectability concept for continuous-time Markov jump linear systems with finite Markov space that generalizes previous concepts found in the literature....
Eduardo F. Costa, João Bosco Ribeiro do Val
CISC
2009
Springer
199views Cryptology» more  CISC 2009»
15 years 3 months ago
Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction without Pairing
Abstract. Certificateless cryptography introduced by Al-Riyami and Paterson eliminates the key escrow problem inherent in identity based cryptosystems. Even though building practic...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...
FCSC
2010
170views more  FCSC 2010»
15 years 2 months ago
Formal verification of concurrent programs with read-write locks
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...
Ming Fu, Yu Zhang, Yong Li