4908 search results - page 955 / 982 » On the Complexity of Optimal K-Anonymity |
95
Voted
GLOBECOM
2007
IEEE
15 years 1 months ago
2007
IEEE
: The improvement of spectral efficiency comes at the cost of exponential increment of signal processing complexity [1]. Hence, the energy-efficiency of baseband has recently turne...
121
click to vote
EUROCRYPT
2008
Springer
15 years 1 months ago
2008
Springer
We introduce a new notion called -isolated proofs of knowledge ( -IPoK). These are proofs of knowledge where a cheating prover is allowed to exchange up to bits of communication wi...
113
click to vote
CIDR
2007
15 years 1 months ago
2007
Fragmentation leads to unpredictable and degraded application performance. While these problems have been studied in detail for desktop filesystem workloads, this study examines n...
107
click to vote
DAIS
2007
15 years 1 months ago
2007
Constructing and executing distributed applications that can adapt to their current operating context, in order to maintain or enhance Quality of Service (QoS) attribute levels, ar...
SIROCCO
2010
15 years 1 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...