4908 search results - page 61 / 982 » On the Complexity of Optimal K-Anonymity |
155
click to vote
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
151
click to vote
ICASSP
2008
IEEE
16 years 18 days ago
2008
IEEE
Lattice reduction by means of the LLL algorithm has been previously suggested as a powerful preprocessing tool that allows to improve the performance of suboptimal detectors and t...
158
click to vote
PIMRC
2008
IEEE
16 years 16 days ago
2008
IEEE
Abstract—Recently M¨uller et al. (IEEE J. Select. Areas Commun. 2008) used asymptotic methods from statistical physics to analyze non-linear vector precoding for MIMO broadcast ...
162
click to vote
AAMAS
2005
Springer
15 years 6 months ago
2005
Springer
We study the complexity of a multilateral negotiation framework where autonomous agents agree on a sequence of deals to exchange sets of discrete resources in order to both further...
193
click to vote
TCS
2010
15 years 4 months ago
2010
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...