19 search results - page 1 / 4 » Sorting and Selection with Imprecise Comparisons |
186
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...
137
Voted
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
A survey of results for the problems of selection, mergingand sorting in the Randomized Parallel Comparison Tree RPCT model is given. The results indicate that while randomization ...
169
Voted
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
161
Voted
SODA
1992
ACM
15 years 7 months ago
1992
ACM
An m
175
click to vote
JDCTA
2010
15 years 1 months ago
2010
To quickly get the median value of any given sequence is very important in many research fields. Some popular sort algorithms are discussed in this paper. Selection sort algorithm...