Sciweavers

5138 search results - page 953 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
16 years 5 days ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
16 years 5 days ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
16 years 5 days ago
Covert two-party computation
We introduce the novel concept of covert two-party computation. Whereas ordinary secure two-party computation only guarantees that no more knowledge is leaked about the inputs of t...
Luis von Ahn, Nicholas J. Hopper, John Langford
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
16 years 3 days ago
Estimating the confidence of conditional functional dependencies
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...
Graham Cormode, Lukasz Golab, Flip Korn, Andrew Mc...
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
16 years 3 days ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande