Sciweavers

503 search results - page 19 / 101
» An Independence Relation for Sets of Secrets
Sort
View
ACNS
2011
Springer
237views Cryptology» more  ACNS 2011»
13 years 3 days ago
Private Discovery of Common Social Contacts
The increasing use of computing devices for social interactions propels the proliferation of online social applications, yet, it prompts a number of privacy concerns. One common p...
Emiliano De Cristofaro, Mark Manulis, Bertram Poet...
AAAI
2011
12 years 8 months ago
Relational Blocking for Causal Discovery
Blocking is a technique commonly used in manual statistical analysis to account for confounding variables. However, blocking is not currently used in automated learning algorithms...
Matthew J. Rattigan, Marc E. Maier, David Jensen
KI
2007
Springer
14 years 2 months ago
Extending Markov Logic to Model Probability Distributions in Relational Domains
Abstract. Markov logic, as a highly expressive representation formalism that essentially combines the semantics of probabilistic graphical models with the full power of first-orde...
Dominik Jain, Bernhard Kirchlechner, Michael Beetz
DATAMINE
2006
83views more  DATAMINE 2006»
13 years 8 months ago
Structural Hidden Markov Models Using a Relation of Equivalence: Application to Automotive Designs
Standard hidden Markov models (HMM's) have been studied extensively in the last two decades. It is well known that these models assume state conditional independence of the ob...
Djamel Bouchaffra, Jun Tan
CRYPTO
2000
Springer
175views Cryptology» more  CRYPTO 2000»
14 years 25 days ago
A Chosen-Ciphertext Attack against NTRU
We present a chosen-ciphertext attack against the public key cryptosystem called NTRU. This cryptosystem is based on polynomial algebra. Its security comes from the interaction of ...
Éliane Jaulmes, Antoine Joux