4908 search results - page 37 / 982 » On the Complexity of Optimal K-Anonymity |
PAMI
2010
15 years 11 days ago
2010
GLOBECOM
2010
IEEE
14 years 12 months ago
2010
IEEE
137
click to vote
ISCAS
2011
IEEE
14 years 5 months ago
2011
IEEE
— The last two decades have seen many efficient algorithms and architectures for the design of low-complexity bit-parallel Multiple Constant Multiplications (MCM) operation, tha...
106
click to vote
DCC
2005
IEEE
16 years 1 months ago
2005
IEEE
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
115
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...