Sciweavers

3384 search results - page 83 / 677
» More Testable Properties
Sort
View
ICCD
1996
IEEE
170views Hardware» more  ICCD 1996»
14 years 27 days ago
Boolean Function Representation Based on Disjoint-Support Decompositions
The Multi-Level Decomposition Diagrams (MLDDs) of this paper are a canonical representation of Boolean functions expliciting disjoint-support decompositions. MLDDs allow the reduc...
Valeria Bertacco, Maurizio Damiani
GRC
2008
IEEE
13 years 9 months ago
Towards Real-time Performance of Data Value Hiding for Frequent Data Updates
Hiding data values in privacy-preserving data mining (PPDM) protects information against unauthorized attacks while maintaining analytical data properties. The most popular models...
Jie Wang, Justin Zhan, Jun Zhang
IJNSEC
2008
147views more  IJNSEC 2008»
13 years 8 months ago
Constructing Efficient Certificateless Public Key Encryption with Pairing
Certificateless public key cryptography was introduced to overcome the key escrow limitation of the identity-based cryptography. Recently, Yum1 and Lee have proposed a generic ser...
Yijuan Shi, Jianhua Li, Jianjun Shi
SYNTHESE
2008
114views more  SYNTHESE 2008»
13 years 8 months ago
Quantified coalition logic
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
ECSQARU
2009
Springer
13 years 6 months ago
Can the Minimum Rule of Possibility Theory Be Extended to Belief Functions?
Abstract. When merging belief functions, Dempster rule of combination is justified only when sources can be considered as independent. When dependencies are ill-known, it is usual ...
Sébastien Destercke, Didier Dubois