2609 search results - page 102 / 522 » Optimizing for parallelism and data locality |
ISHPC
2000
Springer
15 years 4 months ago
2000
Springer
Partitioned parallel radix sort is a parallel radix sort that shortens the execution time by modifying the load balanced radix sort which is known one of the fastest internal sort...
134
Voted
AROBOTS
2002
15 years 15 days ago
2002
We describe techniques to optimally select landmarks for performing mobile robot localization by matching terrain maps. The method is based upon a maximum-likelihood robot localiza...
100
click to vote
ICCS
2009
Springer
14 years 10 months ago
2009
Springer
The Jaccard/Tanimoto coefficient is an important workload, used in a large variety of problems including drug design fingerprinting, clustering analysis, similarity web searching a...
99
Voted
PODC
1998
ACM
15 years 4 months ago
1998
ACM
: We present a new model for handling messages and state in a distributed application that we call Messages in Local Transactions (MLT). Under this model, messages and data are not...
107
Voted
IOPADS
1996
15 years 1 months ago
1996
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...