1623 search results - page 86 / 325 » No Sorting |
140
click to vote
ICALP
1992
Springer
15 years 8 months ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
128
click to vote
ISCI
2006
15 years 4 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...
106
click to vote
JAL
2002
15 years 3 months ago
2002
The number of comparisons Xn used by Quicksort to sort an array of n distinct numbers has mean
109
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
In this paper, we describe a technique to temporally sort a collection of photos that span many years. By reasoning about persistence of visible structures, we show how this sorti...
121
click to vote
VTC
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— This paper addresses Tomlinson-Harashima Precoding (THP) for the downlink of multiuser systems, where the transmitter is equipped with multiple antennas and each decent...