4908 search results - page 212 / 982 » On the Complexity of Optimal K-Anonymity |
191
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The performance of a multiuser MIMO broadcast system depends highly on how the users being served are selected from the pool of users requesting service. Though dirty paper coding...
140
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
It is now well known that time invariant (TI) linear beamformers, such as the Capon’s beamformer, are only optimal for stationary Gaussian observations whose complex envelope is...
254
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
183
click to vote
IACR
2011
14 years 6 months ago
2011
KASUMI is a block cipher which consists eight Feistel rounds with a 128-bit key. The confidentiality and integrity of UMTS, GSM and GPRS mobile communications systems depend heavi...
163
click to vote
CGO
2005
IEEE
16 years 6 days ago
2005
IEEE
The growing complexity of modern processors has made the generation of highly efficient code increasingly difficult. Manual code generation is very time consuming, but it is oft...