Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: When many objects are counted simultaneously in large data streams, as in the course of network traffic monitoring, or bgraph and molecular sequence analyses, memory becomes a limiting factor. Robert Morris [Communications of the ACM, 21:840-842, 1978] proposed a probabilistic technique for approximate counting that is extremely economical. The basic idea is to increment a counter containing the value X with probability 2-X. As a result, the counter contains an approximation of lg n after n probabilistic updates, stored in lg lg n bits. Here  revisit the original idea of Morris.  introduce a binary floating-point counter that combines a d-bit significand with a binary exponent, stored together on d + lglg n bits. The counter yields a simple formula for an unbiased estimation of n with a standard deviation of about 0.6 ċ n2-d/2.#R##N##R##N# analyze the floating-point counter's performance in a general framework that applies to any probabilistic counter. In that framework,  provide practical formulas to construct unbiased estimates, and to assess the asymptotic accuracy of any counter.
['Miklós Csürös']
I am writing a research paper on a idea Approximate counting with a floating-point counter
[{"from": "human", "value": "I am writing a research paper on a idea Approximate counting with a floating-point counter"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: When many objects are counted simultaneously in large data streams, as in the course of network traffic monitoring, or bgraph and molecular sequence analyses, memory becomes a limiting factor. Robert Morris [Communications of the ACM, 21:840-842, 1978] proposed a probabilistic technique for approximate counting that is extremely economical. The basic idea is to increment a counter containing the value X with probability 2-X. As a result, the counter contains an approximation of lg n after n probabilistic updates, stored in lg lg n bits. Here  revisit the original idea of Morris.  introduce a binary floating-point counter that combines a d-bit significand with a binary exponent, stored together on d + lglg n bits. The counter yields a simple formula for an unbiased estimation of n with a standard deviation of about 0.6 \u010b n2-d/2.#R##N##R##N# analyze the floating-point counter's performance in a general framework that applies to any probabilistic counter. In that framework,  provide practical formulas to construct unbiased estimates, and to assess the asymptotic accuracy of any counter."}]