You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@datasketches.apache.org by gi...@apache.org on 2023/02/06 10:02:32 UTC
[datasketches-website] branch asf-site updated: Automatic Site Publish by Buildbot
This is an automated email from the ASF dual-hosted git repository.
git-site-role pushed a commit to branch asf-site
in repository https://gitbox.apache.org/repos/asf/datasketches-website.git
The following commit(s) were added to refs/heads/asf-site by this push:
new 2751beae Automatic Site Publish by Buildbot
2751beae is described below
commit 2751beae3a898c93e47066da155b1f6ed2c8aeb5
Author: buildbot <us...@infra.apache.org>
AuthorDate: Mon Feb 6 10:02:30 2023 +0000
Automatic Site Publish by Buildbot
---
output/docs/Community/Research.html | 6 +++++-
1 file changed, 5 insertions(+), 1 deletion(-)
diff --git a/output/docs/Community/Research.html b/output/docs/Community/Research.html
index dbef74a9..22940a2a 100644
--- a/output/docs/Community/Research.html
+++ b/output/docs/Community/Research.html
@@ -600,10 +600,14 @@ All algorithms in the library produce mergeable summaries, and come with formal
<p><strong>[CEM+15]</strong> Michael B. Cohen, Sam Elder, Cameron Musco, Christopher Musco, and Madalina Persu. Dimensionality reduction for k-means clustering and low rank approximation. In <em>ACM STOC Proceedings ‘15</em>, pages 163–172, 2015.</p>
-<p><strong>[CKLTV+20]</strong> Graham Cormode, Zohar Karnin, Edo Liberty, Justin Thaler, Pavel Vesely. Relative Error Streaming Quantiles, In <em>arXiv.org</em>, 2020.</p>
+<p><strong>[CKLTV+20]</strong> Graham Cormode, Zohar Karnin, Edo Liberty, Justin Thaler, Pavel Vesely. Relative Error Streaming Quantiles,
+In <em>In Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems</em>, 2021.
+<a href="https://dl.acm.org/doi/abs/10.1145/3452021.3458323">Paper</a></p>
<p><strong>[DLRT16]</strong> Anirban Dasgupta, Kevin J. Lang, Lee Rhodes, and Justin Thaler. A framework for estimating stream expression cardinalities. In *EDBT/ICDT Proceedings ‘16 *, pages 6:1–6:17, 2016. <a href="https://arxiv.org/pdf/1510.01455.pdf">Paper</a>. <a href="https://github.com/apache/datasketches-website/blob/master/docs/pdf/icdt-talk.pdf">Talk Slides</a>.</p>
+<p><strong>[DTT22]</strong> Charlie Dickens, Justin Thaler, Daniel Ting. Order-Invariant Cardinality Estimators Are Differentially Private. In <em>Advances in Neural Information Processing Systems.</em> <a href="https://arxiv.org/abs/2203.15400">Paper</a>, <a href="https://neurips.cc/virtual/2022/poster/54146">Slides</a>, <a href="https://neurips.cc/media/PosterPDFs/NeurIPS%202022/54146.png?t=1669130364.160391">Poster</a></p>
+
<p><strong>[FFGM07]</strong> Philippe Flajolet, E ́ric Fusy, Olivier Gandouet, and Fre ́de ́ric Meunier. Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. In <em>DMTCS Conference on Analysis of Algorithms</em>, pages 137–156, 2007.</p>
<p><strong>[FM85]</strong> P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. In <em>Journal of Computer and System Sciences</em>, 31:182–209, 1985.</p>
---------------------------------------------------------------------
To unsubscribe, e-mail: commits-unsubscribe@datasketches.apache.org
For additional commands, e-mail: commits-help@datasketches.apache.org