4908 search results - page 865 / 982 » On the Complexity of Optimal K-Anonymity |
189
click to vote
MICRO
2003
IEEE
15 years 11 months ago
2003
IEEE
It is widely accepted that the disproportionate scaling of transistor and conventional on-chip interconnect performance presents a major barrier to future high performance systems...
202
click to vote
EUROPAR
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Today’s parallel computers with SMP nodes provide both multithreading and message passing as their modes of parallel execution. As a consequence, performance analysis a...
183
click to vote
KBSE
2002
IEEE
15 years 11 months ago
2002
IEEE
ort gives their abstracts. s of the position papers Recent Experiences with Code Generation and Task Automation Agents in Software Tools (J. Grundy, J. Hosking) As software grows i...
191
click to vote
DEXA
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...
177
click to vote
CA
1999
IEEE
15 years 10 months ago
1999
IEEE
The continuously increasing complexity of computer animationsmakes it necessary to rely on the knowledge of various experts to cover the different areas of computer graphics and a...