dbo:abstract
|
- Misra and Gries defined the heavy-hitters problem(though they did not introduce the term heavy-hitters) and described the first algorithmfor it in the paper Finding repeated elements. Their algorithmextends the Boyer-Moore majority finding algorithmin a significant way. One version of the heavy-hitters problem is as follows: Given is abag b of n elements and an integer k ≥ 2. Find the values thatoccur more than n ÷ k times in b. The Misra-Gries algorithm solvesthe problem by making two passes over the values in b, while storingat most k values from b and their number of occurrences during thecourse of the algorithm. Misra-Gries is one of the earliest streaming algorithms,and it is described below in those terms in section . (en)
|
dbo:wikiPageID
| |
dbo:wikiPageLength
|
- 7628 (xsd:nonNegativeInteger)
|
dbo:wikiPageRevisionID
| |
dbo:wikiPageWikiLink
| |
dbp:wikiPageUsesTemplate
| |
dcterms:subject
| |
rdfs:comment
|
- Misra and Gries defined the heavy-hitters problem(though they did not introduce the term heavy-hitters) and described the first algorithmfor it in the paper Finding repeated elements. Their algorithmextends the Boyer-Moore majority finding algorithmin a significant way. Misra-Gries is one of the earliest streaming algorithms,and it is described below in those terms in section . (en)
|
rdfs:label
|
- Misra–Gries heavy hitters algorithm (en)
|
owl:sameAs
| |
prov:wasDerivedFrom
| |
foaf:isPrimaryTopicOf
| |
is dbo:wikiPageRedirects
of | |
is dbo:wikiPageWikiLink
of | |
is foaf:primaryTopic
of | |