22 citations · 22 across the 1 of their papers we have counts for
2 papers
cs.IR2016
Count-Min Tree Sketch: Approximate counting for NLP
Guillaume Pitel, Geoffroy Fouquier, Emmanuel Marchand +1
The Count-Min Sketch is a widely adopted structure for approximate event counting in large scale processing. In a previous work we improved the original version of the Count-Min-Sk…
cs.IR2015★ 22 cited
Count-Min-Log sketch: Approximately counting with approximate counters
Guillaume Pitel, Geoffroy Fouquier
Count-Min Sketch is a widely adopted algorithm for approximate event counting in large scale processing. However, the original version of the Count-Min-Sketch (CMS) suffers of some…