Sciweavers

851 search results - page 2 / 171
» Random constructions and density results
Sort
View
KDD
2004
ACM
159views Data Mining» more  KDD 2004»
13 years 10 months ago
Optimal randomization for privacy preserving data mining
Randomization is an economical and efficient approach for privacy preserving data mining (PPDM). In order to guarantee the performance of data mining and the protection of individ...
Michael Yu Zhu, Lei Liu
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 5 months ago
Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes
In this paper, a simple and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method co...
Enrico Paolini, Marco Chiani
JC
2006
86views more  JC 2006»
13 years 5 months ago
Randomly shifted lattice rules for unbounded integrands
We study the problem of multivariate integration over Rd with integrands of the form f(x)d(x) where d is a probability density function. Practical problems of this form occur comm...
Frances Y. Kuo, Grzegorz W. Wasilkowski, Benjamin ...
SAT
2005
Springer
104views Hardware» more  SAT 2005»
13 years 10 months ago
Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
Marijn Heule, Hans van Maaren
RANDOM
1997
Springer
13 years 9 months ago
Resource-Bounded Randomness and Compressibility with Respect to Nonuniform Measures
Most research on resource-bounded measure and randomness has focused on the uniform probability density, or Lebesgue measure, on {0, 1}∞ ; the study of resource-bounded measure ...
Steven M. Kautz