Optimizing the confidence bound of count-min sketches to estimate the streaming big data query results more precisely (Q783053): Difference between revisions

@@ Property / DOI @@
-.1007/s00607-018-00695-z
@@ Property / DOI: 10.1007/s00607-018-00695-z / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00607-018-00695-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2907142532
@@ Property / OpenAlex ID: W2907142532 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved data stream summary: the count-min sketch and its applications
+Normal rank
@@ Property / cites work @@
+Q5747624
@@ Property / cites work: Q5747624 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Concentration Bounds for Count-Sketch
@@ Property / cites work: Improved Concentration Bounds for Count-Sketch / rank @@
+Normal rank
@@ Property / cites work @@
+Q5798377
@@ Property / cites work: Q5798377 / rank @@
+Normal rank
@@ Property / cites work @@
+Jo-DPMF: differentially private matrix factorization learning through joint optimization
+Normal rank
@@ Property / Wikidata QID @@
+Q128687200
@@ Property / Wikidata QID: Q128687200 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00607-018-00695-Z
@@ Property / DOI: 10.1007/S00607-018-00695-Z / rank @@
+Normal rank