Sciweavers

13026 search results - page 370 / 2606
» Probabilistic Relational Models
Sort
View
CCS
2010
ACM
15 years 5 months ago
Computational indistinguishability logic
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...
Gilles Barthe, Marion Daubignard, Bruce M. Kapron,...
FDL
2005
IEEE
15 years 10 months ago
Architecture description in related standards
Abstract. With this paper we intend to present a brief overview of the current means to describe architecture in different standards. We cover AADL as an example of Architecture De...
David Servat, Frédéric Loiret, S&eac...
APPML
2006
65views more  APPML 2006»
15 years 4 months ago
Some inequalities related to the analysis of electricity auctions
Most balancing markets of electric power are organized as uniform-price auctions. In 2001, the balancing market of England and Wales switched to a pay-as-bid auction with the inte...
Peter Hästö, Pär Holmberg
IJNSEC
2007
109views more  IJNSEC 2007»
15 years 4 months ago
Related-Mode Attacks on CTR Encryption Mode
In this paper, we discuss using CTR mode, another standard encryption mode, to attack other standard encryption modes and using other standard encryption modes to attack CTR mode ...
Dayin Wang, Dongdai Lin, Wenling Wu
SAC
2009
ACM
15 years 11 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad