1464 search results - page 147 / 293 » On optimal anonymization for l -diversity |
160
click to vote
CIKM
2004
Springer
15 years 12 months ago
2004
Springer
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
170
click to vote
RTCSA
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...
159
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
In Deep Sub-Micron (DSM) designs, performance will depend critically on the latency of long wires. We propose a new synthesis methodology for synchronous systems that makes the de...
164
click to vote
ISCA
1994
IEEE
15 years 10 months ago
1994
IEEE
In 1989, the RAID (Redundant Arrays of Inexpensive Disks) group at U. C. Berkeley built a prototype disk array called RAID-I. The bandwidth delivered to clients by RAID-I was seve...
172
click to vote
COMPGEOM
1993
ACM
15 years 10 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...