Fast computation of the median by successive binning

Simple item page
dc.creatorTibshirani, Ryan J.
dc.date2008-06-20
dc.date2009-05-12
dc.date.accessioned2026-07-07T13:13:18Z
dc.date.available2026-07-07T13:13:18Z
dc.descriptionThis 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.
dc.description14 pages, 1 Postscript figure
dc.identifierhttps://arxiv.org/abs/0806.3301
dc.identifierhttp://arxiv.org/abs/0806.3301
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/229844
dc.subjectComputation
dc.subjectData Structures and Algorithms
dc.subjectApplications
dc.titleFast computation of the median by successive binning
dc.typetext

Files

Collections

arXiv