4908 search results - page 363 / 982 » On the Complexity of Optimal K-Anonymity |
171
click to vote
ISCC
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
186
click to vote
ISCAS
2007
IEEE
16 years 1 months ago
2007
IEEE
— A method is presented to synthesize wideband linear-phase FIR filters with a piecewise-polynomial-sinusoidal impulse response. The proposed method is based on merging the earl...
187
click to vote
CISC
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. This paper reports on the improved and multiple linear cryptanalysis of reduced round Serpent by mean of a branch-and-bound characteristic search within the algorithm. We...
142
click to vote
FUN
2007
Springer
16 years 29 days ago
2007
Springer
In this paper we investigate the relations between knitting and computer science. We show that the two disciplines share many concepts. Computer science, in particular algorithm th...
194
click to vote
ICAS
2006
IEEE
16 years 26 days ago
2006
IEEE
By harnessing computational power of distributed heterogeneous resources, it is possible to build a large scale integrated system so that a centralized program is partitioned and ...