4908 search results - page 897 / 982 » On the Complexity of Optimal K-Anonymity |
117
click to vote
DAC
2010
ACM
15 years 2 days ago
2010
ACM
Given the increasing complexity of multi-processor systems-onchip, a wide range of parameters must be tuned to find the best trade-offs in terms of the selected system figures of ...
112
click to vote
SPAA
2010
ACM
15 years 2 days ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
132
click to vote
CVPR
2007
IEEE
15 years 1 days ago
2007
IEEE
Considerable research work has been done in the area of surveillance and biometrics, where the goals have always been high performance, robustness in security and cost optimizatio...
107
click to vote
FOCS
2008
IEEE
15 years 1 days ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
BMCBI
2008
15 years 1 hour ago
2008
Background: Microarray experiments generate vast amounts of data. The functional context of differentially expressed genes can be assessed by querying the Gene Ontology (GO) datab...