4908 search results - page 408 / 982 » On the Complexity of Optimal K-Anonymity |
192
click to vote
APLAS
2005
ACM
16 years 14 days ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
165
click to vote
ICIP
2006
IEEE
16 years 8 months ago
2006
IEEE
Two important signal processing problems in the display side of a holographic 3DTV are the computation of the diffraction field of a 3D object from its abstract representation, an...
187
click to vote
ICIP
1997
IEEE
16 years 8 months ago
1997
IEEE
Oversampled pyramid decompositions have been successfully applied to scalable video coding. Quantization noise feedback at the encoder closed-loop coding" has several advant...
318
click to vote
ICDE
2001
IEEE
16 years 8 months ago
2001
IEEE
Semi-join reducers were introduced in the late seventies as a means to reduce the communication costs of distributed database systems. Subsequent work in the eighties showed, howe...
159
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
We present a set of techniques for placement-coupled, timingdriven logic replication. Two components are at the core of the approach. First is an algorithm for optimal timingdrive...