4908 search results - page 39 / 982 » On the Complexity of Optimal K-Anonymity |
190
click to vote
CDC
2009
IEEE
15 years 3 months ago
2009
IEEE
Stochastic Flow Models (SFMs) are stochastic ystems that abstract the dynamics of complex discrete event systems involving the control of sharable resources. SFMs have been used to...
164
click to vote
TCS
2011
15 years 1 months ago
2011
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n + 2)-nomial with a constant term, allowing real exponents as well as real...
173
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
In this paper, we investigate joint network and channel decoding algorithms for the multiple-access relay channel. We consider a realistic reference scenario with Rayleigh fading ...
180
click to vote
ISQED
2011
IEEE
14 years 9 months ago
2011
IEEE
Due to the dramatic increase in design complexity, verifying the functional correctness of a circuit is becoming more difficult. Therefore, bugs may escape all verification effo...
151
click to vote
ICFEM
2009
Springer
15 years 3 months ago
2009
Springer
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...