4908 search results - page 958 / 982 » On the Complexity of Optimal K-Anonymity |
133
click to vote
ISCAPDCS
2004
15 years 1 months ago
2004
The cache hierarchy design in existing SMT and superscalar processors is optimized for latency, but not for bandwidth. The size of the L1 data cache did not scale over the past de...
126
Voted
IC
2003
15 years 1 months ago
2003
: Remote real laboratories deal with performing real lab experiments remotely via Internet. Recent advances in Internet/web technologies and computer-controlled instrumentation all...
114
click to vote
PDPTA
2004
15 years 1 months ago
2004
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
107
click to vote
USENIX
2004
15 years 1 months ago
2004
For operating system intensive applications, the ability of designers to understand system call performance behavior is essential to achieving high performance. Conventional perfo...
114
Voted
SDM
2003
SIAM
15 years 1 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...