559 search results - page 38 / 112 » Algorithms and Data Structures for External Memory |
132
Voted
PRL
2006
15 years 2 months ago
2006
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
115
Voted
PODC
1990
ACM
15 years 6 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
128
Voted
DAWAK
1999
Springer
15 years 6 months ago
1999
Springer
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
140
click to vote
ISCA
2002
IEEE
15 years 7 months ago
2002
IEEE
This paper introduces the idea of using a User-Level Memory Thread (ULMT) for correlation prefetching. In this approach, a user thread runs on a general-purpose processor in main ...
112
Voted
POPL
1998
ACM
15 years 6 months ago
1998
ACM
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...