On estimating the alphabet size of a discrete random source
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(\sqrt{N})$ time a...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Ginzboorg, Philip |
| description | 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(\sqrt{N})$ time and
space by the memory-restricted variant of this algorithm. |
| doi_str_mv | 10.48550/arxiv.1711.07545 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1711_07545</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1711_07545</sourcerecordid><originalsourceid>FETCH-LOGICAL-a675-b45ee9f580a9157f7e0947f1bf48f46c7f7fa5b969623dce949cb558393d30143</originalsourceid><addsrcrecordid>eNotj71OwzAURr0woMIDMPW-QIKNfeNYTKjiT6rUpXt07VxTS21S2QYBT08pTJ90hk_nCHGjZGt6RHlL-TN9tMoq1UqLBi_F_WYCLjUdqKbpDeqOgfbHHXmuUNI3wxyBYEwlZK4MmaZxPkCZ33PgK3ERaV_4-n8XYvv0uF29NOvN8-vqYd1QZ7HxBpldxF6SU2ijZemMjcpH00fThROJhN51rrvTY2BnXPCIvXZ61FIZvRDLv9uz_XDMJ9n8NfxWDOcK_QNbRkF-</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On estimating the alphabet size of a discrete random source</title><source>arXiv.org</source><creator>Ginzboorg, Philip</creator><creatorcontrib>Ginzboorg, Philip</creatorcontrib><description>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(\sqrt{N})$ time and
space by the memory-restricted variant of this algorithm.</description><identifier>DOI: 10.48550/arxiv.1711.07545</identifier><language>eng</language><subject>Computer Science - Data Structures and Algorithms</subject><creationdate>2017-11</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1711.07545$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1711.07545$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Ginzboorg, Philip</creatorcontrib><title>On estimating the alphabet size of a discrete random source</title><description>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(\sqrt{N})$ time and
space by the memory-restricted variant of this algorithm.</description><subject>Computer Science - Data Structures and Algorithms</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj71OwzAURr0woMIDMPW-QIKNfeNYTKjiT6rUpXt07VxTS21S2QYBT08pTJ90hk_nCHGjZGt6RHlL-TN9tMoq1UqLBi_F_WYCLjUdqKbpDeqOgfbHHXmuUNI3wxyBYEwlZK4MmaZxPkCZ33PgK3ERaV_4-n8XYvv0uF29NOvN8-vqYd1QZ7HxBpldxF6SU2ijZemMjcpH00fThROJhN51rrvTY2BnXPCIvXZ61FIZvRDLv9uz_XDMJ9n8NfxWDOcK_QNbRkF-</recordid><startdate>20171120</startdate><enddate>20171120</enddate><creator>Ginzboorg, Philip</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20171120</creationdate><title>On estimating the alphabet size of a discrete random source</title><author>Ginzboorg, Philip</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a675-b45ee9f580a9157f7e0947f1bf48f46c7f7fa5b969623dce949cb558393d30143</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Computer Science - Data Structures and Algorithms</topic><toplevel>online_resources</toplevel><creatorcontrib>Ginzboorg, Philip</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Ginzboorg, Philip</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On estimating the alphabet size of a discrete random source</atitle><date>2017-11-20</date><risdate>2017</risdate><abstract>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(\sqrt{N})$ time and
space by the memory-restricted variant of this algorithm.</abstract><doi>10.48550/arxiv.1711.07545</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1711.07545 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1711_07545 |
| source | arXiv.org |
| subjects | Computer Science - Data Structures and Algorithms |
| title | On estimating the alphabet size of a discrete random source |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T02%3A08%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20estimating%20the%20alphabet%20size%20of%20a%20discrete%20random%20source&rft.au=Ginzboorg,%20Philip&rft.date=2017-11-20&rft_id=info:doi/10.48550/arxiv.1711.07545&rft_dat=%3Carxiv_GOX%3E1711_07545%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |