Skip to search formSkip to main contentSkip to account menu

Count–min sketch

Known as: CM sketch, Count Min sketch, Count-min sketch 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Frequency estimation data structures such as the count-min sketch (CMS) have found numerous applications in databases, networking… 
2017
2017
In this paper, we present the preliminary work on the adaptation of Count-Min sketch (CMS) data structure to the external storage… 
2016
2016
The Count-Min Sketch is a widely adopted structure for approximate event counting in large scale processing. In a previous work… 
2014
2014
The constrained capacity of wireless sensor nodes and harsh, unattended deploy environments make the data collected by sensor… 
2014
2014
Nowadays, with the increasing speed of communication links and generated traffic volume, Network Intrusion Detection Systems… 
2012
2012
L'apprentissage statistique propose un vaste ensemble de techniques capables de construire des modeles predictifs a partir d… 
2011
2011
Abstract Minwise hashing is a standard technique in the context of search for efficiently computing set similarities. The recent… 
2010
2010
In this paper, we propose a memory, space, and time efficient framework to scale distributional similarity to the web. We exploit… 
2009
2009
  • 2009
  • Corpus ID: 7867041
2005
2005
Count-Min sketch is an efficient approximate query tool for data stream. In this paper we address how to further improve its…