4908 search results - page 981 / 982 » On the Complexity of Optimal K-Anonymity |
EMSOFT
2010
Springer
13 years 3 months ago
2010
Springer
Variable-bandwidth servers (VBS) control process execution speed by allocating variable CPU bandwidth to processes. VBS enables temporal isolation of EDF-scheduled processes in th...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
In this paper we consider the MAX-WEIGHT protocol for routing and scheduling in wireless networks under an adversarial model. This protocol has received a significant amount of a...
HPCA
2012
IEEE
12 years 1 months ago
2012
IEEE
Since the onset of pipelined processors, balancing the delay of the microarchitectural pipeline stages such that each microarchitectural pipeline stage has an equal delay has been...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
PODS
2009
ACM
14 years 6 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...