1763 search results - page 316 / 353 » Dependent random choice |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
Protection of privacy has become an important problem in data mining. In particular, individuals have become increasingly unwilling to share their data, frequently resulting in in...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...