4908 search results - page 184 / 982 » On the Complexity of Optimal K-Anonymity |
184
click to vote
IEEEPACT
2000
IEEE
15 years 11 months ago
2000
IEEE
Region-based compilation repartitions a program into more desirable compilation units for optimization and scheduling, particularly beneficial for ILP architectures. With region-...
143
click to vote
ISSS
1999
IEEE
15 years 10 months ago
1999
IEEE
Portable or embedded systems allow more and more complex applications like multimedia today. These applications and submicronic technologies have made the power consumption criter...
180
click to vote
COMPGEOM
1998
ACM
15 years 10 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
159
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinni...
152
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper we construct fixed finite tile systems that assemble into particular classes of shapes. Moreover, given an arbitrary n, we show how to calculate the tile co...