4908 search results - page 82 / 982 » On the Complexity of Optimal K-Anonymity |
204
click to vote
COCO
2000
Springer
15 years 10 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
187
click to vote
MOR
2007
15 years 5 months ago
2007
This paper studies the possibilities of the Linear Matrix Inequality (LMI) characterization of the matrix cones formed by nonnegative complex Hermitian quadratic functions over sp...
167
click to vote
RTA
2009
Springer
16 years 24 days ago
2009
Springer
We study the derivational complexity induced by the (basic) dependency pair method. Suppose the derivational complexity induced by a termination method is closed under elementary f...
150
click to vote
ISLPED
1996
ACM
15 years 10 months ago
1996
ACM
Estimation of the area complexity of a Boolean function from its functional description is an important step towards a power estimation capability at the register transfer level (...
156
click to vote
GECCO
2007
Springer
16 years 13 days ago
2007
Springer
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...