On estimating the alphabet size of a discrete random source

11/20/2017
by   Philip Ginzboorg, et al.
0

We are concerned with estimating alphabet size N from a stream of symbols taken uniformly at random from that alphabet. We define and analyze a memory-restricted variant of an algorithm that have been earlier proposed for this purpose. The alphabet size N can be estimated in O(√(N)) time and space by the memory-restricted variant of this algorithm.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/08/2017

Extractor-Based Time-Space Lower Bounds for Learning

A matrix M: A × X →{-1,1} corresponds to the following learning problem:...
04/07/2022

Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model

In the adaptive bitprobe model answering membership queries in two bitpr...
07/05/2021

Memory-Sample Lower Bounds for Learning Parity with Noise

In this work, we show, for the well-studied problem of learning parity u...
02/28/2018

Fast Lempel-Ziv Decompression in Linear Space

We consider the problem of decompressing the Lempel-Ziv 77 representatio...
09/12/2018

On the uniform generation of random derangements

We show how to generate random derangements with the expected distributi...
11/27/2019

A Most Irrational Foraging Algorithm

We present a foraging algorithm, GoldenFA, in which search direction is ...
09/22/2020

Variant-based Equational Unification under Constructor Symbols

Equational unification of two terms consists of finding a substitution t...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.