4908 search results - page 42 / 982 » On the Complexity of Optimal K-Anonymity |
167
click to vote
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
138
click to vote
SSWMC
2004
15 years 7 months ago
2004
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
169
click to vote
MST
2007
15 years 5 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
152
click to vote
TWC
2008
15 years 6 months ago
2008
Abstract-- This paper presents a reduced-complexity maximum a posteriori probability (MAP) channel estimator with iterative data detection for orthogonal frequency division multipl...
154
click to vote
TIT
2008
15 years 6 months ago
2008
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...