Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Count–min_sketch> ?p ?o }
Showing triples 1 to 53 of
53
with 100 triples per page.
- Count–min_sketch abstract "In computing, the count–min sketch (CM sketch) is a probabilistic data structure that serves as a frequency table of events in a stream of data. It uses hash functions to map events to frequencies, but unlike a hash table uses only sub-linear space, at the expense of overcounting some events due to collisions. The count–min sketch was invented in 2003 by Graham Cormode and S. Muthu Muthukrishnan and described by them in a 2005 paper.Count–min sketches are essentially the same data structure as the counting Bloom filters introduced in 1998 by Fan et al. However, they are used differently and therefore sized differently: a count-min sketch typically has a sublinear number of cells, related to the desired approximation quality of the sketch, while a counting Bloom filter is more typically sized to match the number of elements in the set.".
- Count–min_sketch wikiPageExternalLink count-min.ppt.
- Count–min_sketch wikiPageExternalLink countmin.c.
- Count–min_sketch wikiPageExternalLink massdal-code-index.html.
- Count–min_sketch wikiPageExternalLink faq.
- Count–min_sketch wikiPageID "33410671".
- Count–min_sketch wikiPageLength "7448".
- Count–min_sketch wikiPageOutDegree "21".
- Count–min_sketch wikiPageRevisionID "702304044".
- Count–min_sketch wikiPageWikiLink Bias_of_an_estimator.
- Count–min_sketch wikiPageWikiLink Bloom_filter.
- Count–min_sketch wikiPageWikiLink Category:Hashing.
- Count–min_sketch wikiPageWikiLink Category:Probabilistic_data_structures.
- Count–min_sketch wikiPageWikiLink Collision_(computer_science).
- Count–min_sketch wikiPageWikiLink Computing.
- Count–min_sketch wikiPageWikiLink DSPACE.
- Count–min_sketch wikiPageWikiLink Data_structure.
- Count–min_sketch wikiPageWikiLink Feature_hashing.
- Count–min_sketch wikiPageWikiLink Graham_Cormode.
- Count–min_sketch wikiPageWikiLink Hash_function.
- Count–min_sketch wikiPageWikiLink Hash_table.
- Count–min_sketch wikiPageWikiLink Inner_product_space.
- Count–min_sketch wikiPageWikiLink Locality-sensitive_hashing.
- Count–min_sketch wikiPageWikiLink Median.
- Count–min_sketch wikiPageWikiLink MinHash.
- Count–min_sketch wikiPageWikiLink Pairwise_independence.
- Count–min_sketch wikiPageWikiLink Randomized_algorithm.
- Count–min_sketch wikiPageWikiLink S._Muthu_Muthukrishnan.
- Count–min_sketch wikiPageWikiLink Streaming_algorithm.
- Count–min_sketch wikiPageWikiLinkText "Count–min sketch".
- Count–min_sketch wikiPageWikiLinkText "count–min sketch".
- Count–min_sketch wikiPageUsesTemplate Template:=.
- Count–min_sketch wikiPageUsesTemplate Template:Cite_conference.
- Count–min_sketch wikiPageUsesTemplate Template:Citeseerx.
- Count–min_sketch wikiPageUsesTemplate Template:Efn.
- Count–min_sketch wikiPageUsesTemplate Template:Math.
- Count–min_sketch wikiPageUsesTemplate Template:Mvar.
- Count–min_sketch wikiPageUsesTemplate Template:Notelist.
- Count–min_sketch wikiPageUsesTemplate Template:R.
- Count–min_sketch wikiPageUsesTemplate Template:Reflist.
- Count–min_sketch subject Category:Hashing.
- Count–min_sketch subject Category:Probabilistic_data_structures.
- Count–min_sketch hypernym Structure.
- Count–min_sketch type Building.
- Count–min_sketch type Redirect.
- Count–min_sketch type Structure.
- Count–min_sketch comment "In computing, the count–min sketch (CM sketch) is a probabilistic data structure that serves as a frequency table of events in a stream of data. It uses hash functions to map events to frequencies, but unlike a hash table uses only sub-linear space, at the expense of overcounting some events due to collisions. The count–min sketch was invented in 2003 by Graham Cormode and S.".
- Count–min_sketch label "Count–min sketch".
- Count–min_sketch sameAs Q5176629.
- Count–min_sketch sameAs m.0h94cvy.
- Count–min_sketch sameAs Q5176629.
- Count–min_sketch wasDerivedFrom Count–min_sketch?oldid=702304044.
- Count–min_sketch isPrimaryTopicOf Count–min_sketch.