Sciweavers

2610 search results - page 224 / 522
» Computational Probabilistic Non-interference
Sort
View
172
Voted
IJAR
2006
125views more  IJAR 2006»
15 years 6 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson
EUROCRYPT
2003
Springer
15 years 11 months ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
BIRTHDAY
2010
Springer
15 years 11 months ago
The Arrow of Time through the Lens of Computing
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
Krishna V. Palem
KR
2010
Springer
15 years 11 months ago
One Hundred Prisoners and a Lightbulb - Logic and Computation
This is a case-study in knowledge representation. We analyze the ‘one hundred prisoners and a lightbulb’ puzzle. In this puzzle it is relevant what the agents (prisoners) know...
Hans P. van Ditmarsch, Jan van Eijck, William Wu
ICDAR
2007
IEEE
16 years 24 days ago
Energy-Based Models in Document Recognition and Computer Vision
The Machine Learning and Pattern Recognition communities are facing two challenges: solving the normalization problem, and solving the deep learning problem. The normalization pro...
Yann LeCun, Sumit Chopra, Marc'Aurelio Ranzato, Fu...