4908 search results - page 830 / 982 » On the Complexity of Optimal K-Anonymity |
165
click to vote
ENTCS
2008
15 years 6 months ago
2008
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
170
click to vote
FTML
2008
15 years 6 months ago
2008
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate stat...
178
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We study the MIMO broadcast channel and compare the achievable throughput for the optimal strategy of dirty paper coding to that achieved with sub-optimal and lower complexity lin...
181
click to vote
DEBU
2006
15 years 6 months ago
2006
Performance tuning in modern database systems requires a lot of expertise, is very time consuming and often misdirected. Tuning attempts often lack a methodology that has a holist...
173
click to vote
EC
2006
15 years 6 months ago
2006
The error threshold of replication is an important notion of the quasispecies evolution model; it is a critical mutation rate (error rate) beyond which structures obtained by an e...