4908 search results - page 394 / 982 » On the Complexity of Optimal K-Anonymity |
144
Voted
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
The interaction and integration of agent technology and data mining presents prominent benefits to solve some of challenging issues in individual areas. For instance, data mining ...
169
Voted
AHS
2006
IEEE
16 years 28 days ago
2006
IEEE
Traditional approaches to evolvable hardware (EHW), in which the field programmable gate array (FPGA) configuration is directly encoded, have not scaled well with increasing cir...
110
click to vote
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
A view selection algorithm takes as input a fact table and computes a set of views to store in order to speed up queries. The performance of view selection algorithm is usually me...
165
Voted
IFL
1997
Springer
15 years 11 months ago
1997
Springer
This paper introduces a new compiler optimization called with-loop-folding. It is based on a special loop construct, the withloop, which in the functional language Sac (for Single ...
187
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...