35 search results - page 7 / 7 » Counting dependent and independent strings |
STOC
2009
ACM
15 years 10 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 ...
100
click to vote
KDD
2000
ACM
15 years 1 months ago
2000
ACM
In this paper we introduce the Generalized Bayesian Committee Machine (GBCM) for applications with large data sets. In particular, the GBCM can be used in the context of kernel ba...
CPM
2005
Springer
15 years 16 hour ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
IACR
2011
13 years 9 months ago
2011
Norway is going to experience an Internet voting scheme in September 2011 for local governmental elections, targeting a comprehensive Internet voting system in 2017 for national el...