Fast computation of the median by successive binning

Details Fast computation of the median by successive binning Fast computation of the median by successive binning

2008-06-20

arxiv.org/abs/0806.3301v2

Statistics

Computation

14 pages, 1 Postscript figure

Scientific paper

This paper describes a new median algorithm and a median approximation
algorithm. The former has O(n) average running time and the latter has O(n)
worst-case running time. These algorithms are highly competitive with the
standard algorithm when computing the median of a single data set, but are
significantly faster in updating the median when more data is added.

Affiliated with

Also associated with

No associations

Rating

Fast computation of the median by successive binning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast computation of the median by successive binning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast computation of the median by successive binning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-370711