4908 search results - page 262 / 982 » On the Complexity of Optimal K-Anonymity |
204
Voted
DBPL
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
185
click to vote
DATE
2000
IEEE
15 years 11 months ago
2000
IEEE
∗∗ Functional BIST is a promising solution for self-testing complex digital systems at reduced costs in terms of area and performance degradation. The present paper addresses t...
155
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper,...
166
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
We study a type of linear placement problem arising in detailed placement optimization of a given cell row in the presence of white-space (extra sites). In this single-row placeme...
165
click to vote
DAC
1999
ACM
15 years 11 months ago
1999
ACM
This paper presents a design methodology, called common-case computation (CCC), and new design automation algorithms for optimizing power consumption or performance. The proposed ...