4908 search results - page 692 / 982 » On the Complexity of Optimal K-Anonymity |
184
click to vote
ALT
2007
Springer
16 years 27 days ago
2007
Springer
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
190
click to vote
CRYPTO
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
199
click to vote
MICRO
2006
IEEE
16 years 22 days ago
2006
IEEE
Designing and optimizing high performance microprocessors is an increasingly difficult task due to the size and complexity of the processor design space, high cost of detailed si...
182
click to vote
CODES
2005
IEEE
16 years 10 days ago
2005
IEEE
The continuous improvement on the design methodologies and processes has made possible the creation of huge and very complex digital systems. Design verification is one of the mai...
197
click to vote
PLDI
2005
ACM
16 years 8 days ago
2005
ACM
Software pipelining of a multi-dimensional loop is an important optimization that overlaps the execution of successive outermost loop iterations to explore instruction-level paral...