New lower and upper bounds for quantile summary algorithms

IGAFIT ALGORITHMIC COLLOQUIUM 4 Graham Cormode, University of Warwick Finding the median, or more generally quantiles, is a core problem in data analysis. The question has been heavily studied in streaming and related models of computation, for over four decades.

Видео New lower and upper bounds for quantile summary algorithms автора Приключения и открытия