Matches in DBpedia 2015-04 for { <http://dbpedia.org/resource/Flajolet-Martin_algorithm> ?p ?o }
Showing triples 1 to 9 of
9
with 100 triples per page.
- Flajolet-Martin_algorithm abstract "The Flajolet-Martin algorithm is an algorithm for approximating the number of distinct elements in a stream with a single pass and space-consumption which is logarithmic in the maximum number of possible distinct elements in the stream. The algorithm was introduced by Philippe Flajolet and G. Nigel Martin in their 1984 paper "Probabilistic Counting Algorithms for Data Base Applications". Later it has been refined in the papers "LogLog counting of large cardinalities" by Marianne Durand and Philippe Flajolet, and "HyperLogLog: The analysis of a near-optimal cardinality estimation algorithm" by Philippe Flajolet et al.In their 2010 paper "An optimal algorithm for the distinct elements problem", Daniel M. Kane, Jelani Nelson and David P. Woodruff gives an improved algorithm which uses nearly optimal space, and has optimal O(1)update and reporting times.".
- Flajolet-Martin_algorithm wikiPageID "44308703".
- Flajolet-Martin_algorithm wikiPageRevisionID "644692432".
- Flajolet-Martin_algorithm subject Category:Algorithms.
- Flajolet-Martin_algorithm comment "The Flajolet-Martin algorithm is an algorithm for approximating the number of distinct elements in a stream with a single pass and space-consumption which is logarithmic in the maximum number of possible distinct elements in the stream. The algorithm was introduced by Philippe Flajolet and G. Nigel Martin in their 1984 paper "Probabilistic Counting Algorithms for Data Base Applications".".
- Flajolet-Martin_algorithm label "Flajolet-Martin algorithm".
- Flajolet-Martin_algorithm sameAs m.012819jy.
- Flajolet-Martin_algorithm wasDerivedFrom Flajolet-Martin_algorithm?oldid=644692432.
- Flajolet-Martin_algorithm isPrimaryTopicOf Flajolet-Martin_algorithm.