Bibliographic Details
| Title: |
Approximate counting with counters: A detailed analysis |
| Authors: |
Prodinger, Helmut1 hproding@sun.ac.za |
| Source: |
Theoretical Computer Science. Jun2012, Vol. 439, p58-68. 11p. |
| Subjects: |
Approximation algorithms, Counters (Computer science), Parameter estimation, Conditional expectations, Analysis of variance, Mathematical formulas |
| Abstract: |
Abstract: The classical algorithm approximate counting has been recently modified by Cichoń and Macyna: instead of one counter, counters are used, and the assignment of an incoming item to one of the counters is random. The parameter of interest is the sum of the values of all the counters. We analyse expectation and variance, getting explicit and asymptotic formulæ. [Copyright &y& Elsevier] |
|
Copyright of Theoretical Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
