35 search results - page 1 / 7 » Efficient unbalanced merge-sort |
ISCI
2006
13 years 8 months ago
2006
Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their efficiency and to their intrinsically parallelizable structure. Among them, th...
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
We describe the implementation of an out-of-core, distribution-based sorting program on a cluster using FG, a multithreaded programming framework. FG mitigates latency from disk-I/...
BMCBI
2010
13 years 3 months ago
2010
Background: Elucidating protein-protein interactions (PPIs) is essential to constructing protein interaction networks and facilitating our understanding of the general principles ...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Ontology matching, aiming to obtain semantic correspondences between two ontologies, has played a key role in data exchange, data integration and metadata management. Among numero...
PVLDB
2008
13 years 8 months ago
2008
Sorting a list of input numbers is one of the most fundamental problems in the field of computer science in general and high-throughput database applications in particular. Althou...