688 search results - page 2 / 138 » On the Computational Complexity of Optimal Sorting Network V... |
PERCOM
2003
ACM
14 years 5 months ago
2003
ACM
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper, we present a novel approach for parallel sorting on stream processing architectures. It is based on adaptive bitonic sorting. For sorting n values utilizing p strea...
ICDE
2010
IEEE
14 years 2 months ago
2010
IEEE
— Many applications require sorting a table over multiple sort orders: generation of multiple reports from a table, evaluation of a complex query that involves multiple instances...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
IPPS
1999
IEEE
13 years 10 months ago
1999
IEEE
HeteroSort load balances and sorts within static or dynamic networks. Upon failure of a node or path, HeteroSort uses a genetic algorithm to minimize the distribution path by optim...