Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q4781762> ?p ?o }
Showing triples 1 to 20 of
20
with 100 triples per page.
- Q4781762 subject Q7216427.
- Q4781762 abstract "The approximate counting algorithm allows the counting of a large number of events using a small amount of memory. Invented in 1977 by Robert Morris (cryptographer) of Bell Labs, it uses probabilistic techniques to increment the counter. It was fully analyzed in the early 1980s by Philippe Flajolet of INRIA Rocquencourt, who coined the name Approximate Counting, and strongly contributed to its recognition among the research community. The algorithm is considered one of the precursors of streaming algorithms, and the more general problem of determining the frequency moments of a data stream has been central to the field.".
- Q4781762 wikiPageExternalLink Flajolet85c.pdf.
- Q4781762 wikiPageExternalLink approx_count_3.pdf.
- Q4781762 wikiPageWikiLink Q1136880.
- Q4781762 wikiPageWikiLink Q1146208.
- Q4781762 wikiPageWikiLink Q11660.
- Q4781762 wikiPageWikiLink Q1304547.
- Q4781762 wikiPageWikiLink Q15222032.
- Q4781762 wikiPageWikiLink Q2115856.
- Q4781762 wikiPageWikiLink Q217365.
- Q4781762 wikiPageWikiLink Q247299.
- Q4781762 wikiPageWikiLink Q2493.
- Q4781762 wikiPageWikiLink Q33456.
- Q4781762 wikiPageWikiLink Q518730.
- Q4781762 wikiPageWikiLink Q583461.
- Q4781762 wikiPageWikiLink Q7216427.
- Q4781762 wikiPageWikiLink Q92695.
- Q4781762 comment "The approximate counting algorithm allows the counting of a large number of events using a small amount of memory. Invented in 1977 by Robert Morris (cryptographer) of Bell Labs, it uses probabilistic techniques to increment the counter. It was fully analyzed in the early 1980s by Philippe Flajolet of INRIA Rocquencourt, who coined the name Approximate Counting, and strongly contributed to its recognition among the research community.".
- Q4781762 label "Approximate counting algorithm".