Sorting by Address Calculation
Journal of the ACM (JACM)
ACM '67 Proceedings of the 1967 22nd national conference
Analysis of computational systems: Cumulative polygon address calculation sorting
ACM '65 Proceedings of the 1965 20th national conference
Non-uniform key distribution and address calculation sorting
ACM '66 Proceedings of the 1966 21st national conference
Distribution-dependent hashing functions and their characteristics
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Expandable open addressing hash table storage and retrieval
SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
| Hi-index | 0.00 |
In a paper published in last year's A.C.M. Proceedings a new method for estimating the population density, i.e., f, was described1 The procedure was based upon the use of sample trigonometric moments as unbiased estimates of density f's Fourier coefficients. It was noted, but not further discussed, that the cumulative distribution function F associated with density f could be approximated by an estimator &Fcirc;m associated with density estimator &fcirc;m, and that &Fcirc;m possessed the following properties: The coefficients &Bcirc;k are unbiased estimators of the Fourier coefficients of the function F(x)−[(x−a)/(b−a)] and therefore simple M.I.S.E. (Mean Integrated Square Error) expressions could be obtained for estimator &Fcirc;m. Also as m→@@, &Fcirc;m→F* where F* represents the sample cumulative (step function). In this paper the estimator &Fcirc;m will be more fully discussed and an application to the problem of address calculation insertion will be described.