Sciweavers

2735 search results - page 176 / 547
» Comparing notions of randomness
Sort
View
ESORICS
2010
Springer
13 years 11 months ago
On Bounding Problems of Quantitative Information Flow
Abstract. Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the gue...
Hirotoshi Yasuoka, Tachio Terauchi
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 10 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
VIROLOGY
2008
84views more  VIROLOGY 2008»
13 years 10 months ago
Formal affordance-based models of computer virus reproduction
We present a novel classification of computer viruses using a formalised notion of reproductive models based on Gibson's theory of affordances. A computer virus reproduction ...
Matt Webster, Grant Malcolm
JSS
1998
87views more  JSS 1998»
13 years 10 months ago
On using similarity for concurrency control in real-time database systems
Most of the proposed concurrency control protocols for real-time database systems (RTDBS) are based on serializability theorem. Owing to the unique characteristics of real-time da...
Kam-yiu Lam, Wai-cheong Yau
LOGCOM
2010
143views more  LOGCOM 2010»
13 years 8 months ago
Vietoris Bisimulations
Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces, we introduce and study the concept of a Vietoris bisimulation...
Nick Bezhanishvili, Gaëlle Fontaine, Yde Vene...