Sciweavers

5138 search results - page 22 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
APPROX
2007
Springer
141views Algorithms» more  APPROX 2007»
14 years 4 months ago
The Cover Time of Random Digraphs
We study the cover time of a random walk on the random digraph Dn,p when np =
Colin Cooper, Alan M. Frieze
SODA
2012
ACM
195views Algorithms» more  SODA 2012»
12 years 5 days ago
Concentration and moment inequalities for polynomials of independent random variables
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
Warren Schudy, Maxim Sviridenko
CRYPTO
2012
Springer
222views Cryptology» more  CRYPTO 2012»
12 years 6 days ago
Secure Identity-Based Encryption in the Quantum Random Oracle Model
We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model ...
Mark Zhandry
ICCV
2011
IEEE
12 years 9 months ago
Perturb-and-MAP Random Fields: Using Discrete Optimization\\to Learn and Sample from Energy Models
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...
George Papandreou, Alan L. Yuille
ICDM
2009
IEEE
124views Data Mining» more  ICDM 2009»
13 years 7 months ago
A Practical Differentially Private Random Decision Tree Classifier
In this paper, we study the problem of constructing private classifiers using decision trees, within the framework of differential privacy. We first construct privacy-preserving ID...
Geetha Jagannathan, Krishnan Pillaipakkamnatt, Reb...