4908 search results - page 182 / 982 » On the Complexity of Optimal K-Anonymity |
146
click to vote
FOCS
2008
IEEE
16 years 29 days ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
167
click to vote
ICRA
2008
IEEE
16 years 29 days ago
2008
IEEE
Abstract— In this paper, we explore the capabilities of actuated models of the compass gait walker on rough terrain. We solve for the optimal high-level feedback policy to negoti...
159
click to vote
SECURWARE
2008
IEEE
16 years 27 days ago
2008
IEEE
Trust network analysis with subjective logic (TNA-SL) simplifies complex trust graphs into series-parallel graphs by removing the most uncertain paths to obtain a canonical graph...
190
click to vote
ICC
2007
IEEE
16 years 25 days ago
2007
IEEE
—We address the problem of distributed source coding of binary sources with side information at the decoder. We propose a compression scheme using irregular turbo codes. We optim...
157
click to vote
DATE
2006
IEEE
16 years 17 days ago
2006
IEEE
This paper explores optimization techniques of the synchronization mechanisms for MPSoCs based on complex interconnect (Network-on-Chip), targeted at future powerefficient system...