Sciweavers

3937 search results - page 703 / 788
» Questioning Ubiquitous Computing
Sort
View
CCS
2008
ACM
13 years 9 months ago
Black-box accountable authority identity-based encryption
A well-known concern in the setting of identity based encryption is that the PKG is all powerful and has to be completely trusted. To mitigate this problem, the notion of Accounta...
Vipul Goyal, Steve Lu, Amit Sahai, Brent Waters
IJCAI
2007
13 years 9 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
NIPS
2001
13 years 9 months ago
Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
Roni Khardon, Dan Roth, Rocco A. Servedio
UAI
2000
13 years 9 months ago
Being Bayesian about Network Structure
In many domains, we are interested in analyzing the structure of the underlying distribution, e.g., whether one variable is a direct parent of the other. Bayesian model selection a...
Nir Friedman, Daphne Koller
CRYPTO
2010
Springer
188views Cryptology» more  CRYPTO 2010»
13 years 9 months ago
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
Homomorphic encryption (HE) schemes enable computing functions on encrypted data, by means of a public Eval procedure that can be applied to ciphertexts. But the evaluated ciphert...
Craig Gentry, Shai Halevi, Vinod Vaikuntanathan