225 search results - page 10 / 45 » On Adaptive Integer Sorting |
SPAA
1995
ACM
13 years 12 months ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
CGO
2005
IEEE
14 years 2 months ago
2005
IEEE
The growing complexity of modern processors has made the generation of highly efficient code increasingly difficult. Manual code generation is very time consuming, but it is oft...
CIAC
1997
Springer
14 years 18 days ago
1997
Springer
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
SIGGRAPH
1998
ACM
14 years 20 days ago
1998
ACM
We present an efficient algorithm for visibility sorting a set of moving geometric objects into a sequence of image layers which are composited to produce the final image. Inste...
FOCS
2004
IEEE
14 years 5 days ago
2004
IEEE
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...