4908 search results - page 799 / 982 » On the Complexity of Optimal K-Anonymity |
143
click to vote
ECRTS
1999
IEEE
15 years 11 months ago
1999
IEEE
Scheduling time impact on system performance increases especially when using dynamic priority algorithms, because of the enlarged computational effort at runtime. This overhead ca...
163
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
167
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
167
click to vote
SIGMOD
1999
ACM
15 years 10 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
204
click to vote
ICCV
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper describes a new method for estimating the illumination distribution of a real scene from a radiance distribution inside shadows cast by an object in the scene. First, t...