4908 search results - page 260 / 982 » On the Complexity of Optimal K-Anonymity |
182
Voted
ACMMSP
2005
ACM
16 years 6 days ago
2005
ACM
In this work we investigate the impact of evolving memory system features, such as large on-chip caches, automatic prefetch, and the growing distance to main memory on 3D stencil ...
187
click to vote
PPOPP
2005
ACM
16 years 6 days ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
175
click to vote
SC
2005
ACM
16 years 6 days ago
2005
ACM
Advanced instruments in a variety of scientific domains are collecting massive amounts of data that must be postprocessed and organized to support research activities. Astronomers...
157
click to vote
DBISP2P
2005
Springer
16 years 5 days ago
2005
Springer
In this work we address the issue of efficient processing of range queries in DHT-based P2P data networks. The novelty of the proposed approach lies on architectures, algorithms, ...
180
click to vote
DEXA
2005
Springer
16 years 5 days ago
2005
Springer
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...