Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Count–min_sketch> ?p ?o. }
Showing items 1 to 11 of
11
with 100 items per page.
- Count–min_sketch abstract "The Count–min sketch (or CM sketch) is a probabilistic sub-linear space streaming algorithm which can be used to summarize a data stream in many different ways. The algorithm was invented in 2003 by Graham Cormode and S. Muthu Muthukrishnan.Count–min sketches are somewhat similar to Bloom filters; the main distinction is that Bloom filters represent sets, while CM sketches represent multisets and frequency tables.".
- Count–min_sketch wikiPageID "33410671".
- Count–min_sketch wikiPageRevisionID "600786634".
- Count–min_sketch subject Category:Hashing.
- Count–min_sketch subject Category:Probabilistic_data_structures.
- Count–min_sketch comment "The Count–min sketch (or CM sketch) is a probabilistic sub-linear space streaming algorithm which can be used to summarize a data stream in many different ways. The algorithm was invented in 2003 by Graham Cormode and S. Muthu Muthukrishnan.Count–min sketches are somewhat similar to Bloom filters; the main distinction is that Bloom filters represent sets, while CM sketches represent multisets and frequency tables.".
- Count–min_sketch label "Count–min sketch".
- Count–min_sketch sameAs Count%E2%80%93min_sketch.
- Count–min_sketch sameAs Q5176629.
- Count–min_sketch sameAs Q5176629.
- Count–min_sketch wasDerivedFrom Count–min_sketch?oldid=600786634.