The P2 algorithm for dynamic calculation of quantiles and histograms without storing observations
暂无分享,去创建一个
[1] Jeffrey Scott Vitter. Implementations for coalesced hashing , 1982, CACM.
[2] Ronald L. Rivest,et al. Expected time bounds for selection , 1975, Commun. ACM.
[3] W. W. Peterson,et al. Addressing for Random-Access Storage , 1957, IBM J. Res. Dev..
[4] B. Schmeiser,et al. Quantile estimation from grouped data: the cell midpoint , 1977 .
[5] Chee-Keng Yap,et al. New upper bounds for selection , 1976, CACM.
[6] J. A. van der Pool,et al. Optimum storage allocation for initial loading of a file , 1972 .
[7] David P. Dobkin,et al. Optimal Time Minimal Space Selection Algorithms , 1981, JACM.
[8] Werner Buchholz,et al. File Organization and Addressing , 1963, IBM Syst. J..
[9] Arnold Schönhage,et al. Finding the Median , 1976, J. Comput. Syst. Sci..