478 search results - page 6 / 96 » Improving probability bounds by optimization over subsets |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
CSFW
2007
IEEE
14 years 1 months ago
2007
IEEE
Randomized protocols for hiding private information can often be regarded as noisy channels in the informationtheoretic sense, and the inference of the concealed information can b...
26
Voted
JMLR
2012
11 years 10 months ago
2012
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
RSA
2002
13 years 7 months ago
2002
Let be a finite index set and k 1 a given integer. Let further S []k be an arbitrary family of k element subsets of . Consider a (binomial) random subset p of , where p = (pi :...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
In this paper we deal with two problems which are of great interest in the field of distributed decision making and control. The first problem we tackle is the problem of achieving...