Countmin sketch - PDFSEARCH.IO - Document Search Engine

Countmin sketch
Results: 5

#	Item
1	POIsketch: Semantic Place Labeling over User Activity Streams 1 Dingqi Yang1 , Bin Li2 , Philippe Cudr´e-Mauroux1 eXascale Infolab, University of Fribourg, 1700 Fribourg, Switzerland 2 Add to Reading List Source URL: exascale.info Language: English - Date: 2016-08-17 10:09:29 Information science Information retrieval Hashing Countmin sketch Recommender system MinHash K-nearest neighbors algorithm Feature hashing Cryptographic hash function Collaborative filtering
2	Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams Anshumali Shrivastava Arnd Christian König Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2016-02-11 06:56:56 Time series analysis Econometrics Autoregressive conditional heteroskedasticity Countmin sketch Range query Information retrieval Information science Computing
3	CS168: The Modern Algorithmic Toolbox Lecture #2: Approximate Heavy Hitters and the Count-Min Sketch Tim Roughgarden & Gregory Valiant∗ March 30, 2016 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-06-04 09:49:43 Hashing Search algorithms Bloom filter Countmin sketch Hash table Hash function Set Universal hashing Filter RabinKarp algorithm Feature hashing
4	Efficient Private Statistics with Succinct Sketches Luca Melis, George Danezis, and Emiliano De Cristofaro Department of Computer Science, University College London {luca.melis.14, g.danezis, e.decristofaro}@ucl.ac.uk Ab Add to Reading List Source URL: www0.cs.ucl.ac.uk Language: English Hashing Recommender system Information science Information retrieval Countmin sketch Internet privacy Privacy Computing
5	New Estimation Algorithms for Streaming Data: Count-min Can Do More Fan Deng University of Alberta Davood Rafiei Add to Reading List Source URL: webdocs.cs.ualberta.ca Language: English - Date: 2013-08-08 14:28:29 Hashing Countmin sketch Bloom filter Set