Sciweavers

1375 search results - page 31 / 275
» eg 2006
Sort
View
MSCS
2006
106views more  MSCS 2006»
13 years 8 months ago
LQP: the dynamic logic of quantum information
We present a dynamic logic for reasoning about information flow in quantum programs. In particular, we give a finitary syntax and a relational semantics for a Logic of Quantum Pro...
Alexandru Baltag, Sonja Smets
IJAIT
2007
180views more  IJAIT 2007»
13 years 8 months ago
Detection and Prediction of Rare Events in Transaction Databases
Rare events analysis is an area that includes methods for the detection and prediction of events, e.g. a network intrusion or an engine failure, that occur infrequently and have s...
Christos Berberidis, Ioannis P. Vlahavas
IJNSEC
2007
128views more  IJNSEC 2007»
13 years 8 months ago
LFSR-based Signatures with Message Recovery
In order to reduce key sizes and bandwidth, several LFSRbased (linear feedback shift register) public key cryptosystems and signature schemes have been proposed. Digital signature...
Xiangxue Li, Dong Zheng, Kefei Chen
COMBINATORICS
2000
92views more  COMBINATORICS 2000»
13 years 7 months ago
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...
Jason P. Bell, Edward A. Bender, Peter J. Cameron,...
COMBINATORICS
2000
85views more  COMBINATORICS 2000»
13 years 7 months ago
Inequality Related to Vizing's Conjecture
Let (G) denote the domination number of a graph G and let G H denote the Cartesian product of graphs G and H. We prove that (G)(H) 2(G H) for all simple graphs G and H. 2000 Math...
W. Edwin Clark, Stephen Suen