36 search results - page 6 / 8 » An improved probability bound for the Approximate S-Lemma |
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...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Owing to the non-zero probability of the missed detection and false alarm of active primary transmission, a certain degree of performance degradation of the primary user (PU) from...
ASPDAC
2008
ACM
13 years 9 months ago
2008
ACM
In modern circuit design, it is difficult to provide reliable parametric yield prediction since the real distribution of process data is hard to measure. Most existing approaches ...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we introduce robust cyclic space– frequency (CSF) filtering for systems combining bit–interleaved coded modulation (BICM) and orthogonal frequency division ...