Sciweavers

461 search results - page 21 / 93
» Higher Kurtz randomness
Sort
View
ML
2012
ACM
413views Machine Learning» more  ML 2012»
13 years 5 months ago
Gradient-based boosting for statistical relational learning: The relational dependency network case
Dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. Relational Dependency Networks (RDNs) are...
Sriraam Natarajan, Tushar Khot, Kristian Kersting,...
EUROCRYPT
2012
Springer
13 years 1 days ago
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
We describe a compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan’s (DGHV) fully homomorphic scheme over the integers from ËœO(Î...
Jean-Sébastien Coron, David Naccache, Mehdi...
DIMVA
2008
14 years 10 months ago
Data Space Randomization
Over the past several years, US-CERT advisories, as well as most critical updates from software vendors, have been due to memory corruption vulnerabilities such as buffer overflo...
Sandeep Bhatkar, R. Sekar
67
Voted
AIED
2007
Springer
15 years 3 months ago
Choosing Reading Passages for Vocabulary Learning by Topic to Increase Intrinsic Motivation
: Intrinsic motivation has been shown in previous research to lead to better learning. In order to increase intrinsic motivation, REAP, a tutoring system for ESL vocabulary was enh...
Michael Heilman, Alan Juffs, Maxine Eskenazi
SIGMOD
2005
ACM
128views Database» more  SIGMOD 2005»
15 years 9 months ago
Deriving Private Information from Randomized Data
Randomization has emerged as a useful technique for data disguising in privacy-preserving data mining. Its privacy properties have been studied in a number of papers. Kargupta et ...
Zhengli Huang, Wenliang Du, Biao Chen