4908 search results - page 20 / 982 » On the Complexity of Optimal K-Anonymity |
129
click to vote
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— ABBA codes, a class of quasi-orthogonal space-time block codes (STBC) proposed by Tirkkonen et al., have been studied extensively for various applications. Yuen et al. have rec...
ASIACRYPT
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract - We propose a new space-time code (STC) structure that can achieve generalized optimal diversity (GOD) with a reduced design complexity, and also provide an increased cod...
123
click to vote
TWC
2008
15 years 1 months ago
2008
OFDMA resource allocation assigns subcarriers and power, and possibly data rates, to each user. Previous research efforts to optimize OFDMA resource allocation with respect to comm...
117
click to vote
AUTOMATICA
2008
15 years 2 months ago
2008
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...