Sciweavers

20 search results - page 2 / 4
» Explicit Randomness is not Necessary when Modeling Probabili...
Sort
View
PKC
2005
Springer
192views Cryptology» more  PKC 2005»
13 years 11 months ago
Securing RSA-KEM via the AES
RSA-KEM is a popular key encapsulation mechanism that combines the RSA trapdoor permutation with a key derivation function (KDF). Often the details of the KDF are viewed as orthogo...
Jakob Jonsson, Matthew J. B. Robshaw
SSD
2007
Springer
124views Database» more  SSD 2007»
13 years 11 months ago
Querying Objects Modeled by Arbitrary Probability Distributions
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
Christian Böhm, Peter Kunath, Alexey Pryakhin...
LICS
2006
IEEE
13 years 11 months ago
Provable Implementations of Security Protocols
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...
Andrew D. Gordon
ECCV
2008
Springer
14 years 7 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
IJAR
2002
102views more  IJAR 2002»
13 years 5 months ago
Networks of probabilistic events in discrete time
The usual methods of applying Bayesian networks to the modeling of temporal processes, such as Dean and Kanazawa's dynamic Bayesian networks (DBNs), consist in discretizing t...
Severino F. Galán, Francisco Javier D&iacut...