4908 search results - page 179 / 982 » On the Complexity of Optimal K-Anonymity |
150
click to vote
POPL
2000
ACM
15 years 11 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
134
click to vote
DATE
2010
IEEE
15 years 11 months ago
2010
IEEE
We have proposed (, )-based flow regulation to reduce delay and backlog bounds in SoC architectures, where bounds the traffic burstiness and the traffic rate. The regulation is co...
173
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
193
click to vote
CISS
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract-Joint subcarrier, power and rate allocation in orthogonal frequency division multiple access (OFDMA) scheduling is investigated for both downlink and uplink wireless trans...
177
click to vote
HICSS
2009
IEEE
15 years 9 months ago
2009
IEEE
Security of e-voting systems does not only depend on the voting protocol 1 or the software used but concerns the whole system with all its components. To guarantee security a holi...