4908 search results - page 141 / 982 » On the Complexity of Optimal K-Anonymity |
159
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Approximations can aim at having close to optimal value or, alternatively, they can aim at structurally resembling an optimal solution. Whereas value-approximation has been extensi...
286
click to vote
BWCCA
2010
15 years 1 months ago
2010
Network-on-Chip (NoC) architectures provide a good way of realizing efficient interconnections and largely alleviate the limitations of bus-based solutions. NoC has emerged as a so...
184
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—The problem of optimal power allocation among the relays in a two-hop decode-and-forward cooperative relay network with independent Rayleigh fading channels is considered. It is...
151
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper considers weighted sum rate maximization of multiuser multiple-input single-output interference channel (MISO-IFC) under outage constraints. The outage-constrained weig...
212
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...