4908 search results - page 72 / 982 » On the Complexity of Optimal K-Anonymity |
156
click to vote
DAGSTUHL
2000
15 years 7 months ago
2000
A strategy S solving a navigation task T is called competitive with ratio r if the cost of solving any instance t of T does not exceed r times the cost of solving t optimally. The ...
170
click to vote
ICIP
2003
IEEE
16 years 7 months ago
2003
IEEE
This paper proposes a new method of designing finitesupport wavelet filters, based on minimization of energy in key parts of the frequency domain. In particular this technique is ...
152
click to vote
GLOBECOM
2008
IEEE
16 years 19 days ago
2008
IEEE
— In this paper, we propose a new decoding algorithm for quasi-orthogonal space-time block codes (QOSTBCs) which achieves near Maximum Likelihood (ML) performance while substanti...
172
click to vote
ICC
2007
IEEE
16 years 15 days ago
2007
IEEE
Abstract— In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink ...
159
click to vote
SAC
2006
ACM
16 years 4 days ago
2006
ACM
Complex environmental modeling often involves a large number of unknown physical and ecological parameters. Parameter estimation is one of the most difficult steps in many modelin...