11394 search results - page 135 / 2279 » Error-Correcting Data Structures |
193
click to vote
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
139
click to vote
PPOPP
2010
ACM
16 years 8 days ago
2010
ACM
To achieve high-performance on multicore systems, sharedmemory parallel languages must efficiently implement atomic operations. The commonly used and studied paradigms for atomici...
116
click to vote
HPCA
2000
IEEE
15 years 7 months ago
2000
IEEE
Prefetching offers the potential to improve the performance of linked data structure (LDS) traversals. However, previously proposed prefetching methods only work well when there i...
149
click to vote
COCOON
1999
Springer
15 years 7 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
132
click to vote
CSL
2010
Springer
15 years 4 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...