4908 search results - page 164 / 982 » On the Complexity of Optimal K-Anonymity |
173
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
1 A relay station (RS)-based cellular system deployment is considered, where multiple base stations (BS) cooperate in the BSRS in-band transmission for the downlink. With the joint...
289
click to vote
EUROCRYPT
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. In this paper we construct several tools for manipulating pools of biases in the analysis of RC4. Then, we show that optimized strategies can break WEP based on 4000 pack...
219
click to vote
FOGA
2011
14 years 10 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
203
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Lossy compression of hyperspectral and ultraspectral images is traditionally performed using 3D transform coding. This approach yields good performance, but its complexity and mem...
232
click to vote
JMLR
2012
13 years 9 months ago
2012
A challenging problem of multi-label learning is that both the label space and the model complexity will grow rapidly with the increase in the number of labels, and thus makes the...