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 2020/08/10 18:33:07 UTC
[incubator-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/incubator-datasketches-website.git
The following commit(s) were added to refs/heads/asf-site by this push:
new f09fb01 Automatic Site Publish by Buildbot
f09fb01 is described below
commit f09fb01990dbf7ec14a4ccc46eda5e8f5478e248
Author: buildbot <us...@infra.apache.org>
AuthorDate: Mon Aug 10 18:33:03 2020 +0000
Automatic Site Publish by Buildbot
---
output/docs/Community/Research.html | 8 +++++---
1 file changed, 5 insertions(+), 3 deletions(-)
diff --git a/output/docs/Community/Research.html b/output/docs/Community/Research.html
index 842a919..04d1513 100644
--- a/output/docs/Community/Research.html
+++ b/output/docs/Community/Research.html
@@ -592,10 +592,12 @@ and come with formal guarantees on the accuracy of the answers returned.</p>
<p><strong>[CCM10]</strong> Amit Chakrabarti, Graham Cormode, and Andrew McGregor. A near-optimal algorithm for estimating the entropy of a stream. In <em>ACM Trans. Algorithms</em>, 6(3):51:1–51:21, 2010.</p>
-<p><strong>[CDKLT09]</strong> Edith Cohen, Nick Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. Stream sampling for variance-optimal estimation of subset sums. In <strong>Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms</strong> SODA 2009.</p>
+<p><strong>[CDKLT09]</strong> Edith Cohen, Nick Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. Stream sampling for variance-optimal estimation of subset sums. In <em>Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms</em> SODA 2009.</p>
<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>[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/incubator-datasketches-website/blob/master/docs/pdf/icdt-talk.pdf">Talk Slides</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>
@@ -608,7 +610,7 @@ and come with formal guarantees on the accuracy of the answers returned.</p>
<p><strong>[GT02]</strong> Phillip B. Gibbons and Srikanta Tirthapura. Distributed streams algorithms for sliding windows. In <em>ACM SPAA Proceedings ‘02</em>, pages 63–72, New York, NY, USA, 2002.</p>
-<p><strong>[ILLKB19]</strong> Nikita Ivkin, Edo Liberty, Kevin Lang, Zohar Karnin, Vladimir Braverman. Streaming Quantiles Algorithms with Small Space and Update Time. In <em>arXiv</em>, 2019</p>
+<p><strong>[ILLKB19]</strong> Nikita Ivkin, Edo Liberty, Kevin Lang, Zohar Karnin, Vladimir Braverman. Streaming Quantiles Algorithms with Small Space and Update Time. In <em>arXiv.org</em>, 2019</p>
<p><strong>[K98]</strong> Donald E. Knuth. The Art of Computer Programming, 3rd Ed. 1998.</p>
@@ -624,7 +626,7 @@ and come with formal guarantees on the accuracy of the answers returned.</p>
<p><strong>[MST12]</strong> Michael Mitzenmacher, Thomas Steinke, and Justin Thaler. Hierarchical heavy hitters with the space saving algorithm. In <em>SIAM ALENEX Proceedings ‘12</em>, pages 160–174, 2012.</p>
-<p><strong>[RLS+15]</strong> Lee Rhodes, Kevin Lang, Alexander Saydakov, Justin Thaler, Edo Liberty, and Jon Malkin. <strong>Apache DataSketches</strong>: A Java software library for streaming data algorithms. Apache License, Version 2.0, 2015. <a href="https://datasketches.apache.org">https://datasketches.apache.org</a>.</p>
+<p><strong>[RLS+15]</strong> Lee Rhodes, Kevin Lang, Alexander Saydakov, Justin Thaler, Edo Liberty, and Jon Malkin. <a href="https://datasketches.apache.org">Apache DataSketches</a>: A Java software library for streaming data algorithms. Apache License, Version 2.0, 2015. <a href="https://datasketches.apache.org">https://datasketches.apache.org</a>.</p>
<p><strong>[Tha07]</strong> Justin Thaler. REU project website: A near-optimal algorithm for computing the entropy of a stream, 2007. <a href="https://people.cs.georgetown.edu/jthaler">https://people.cs.georgetown.edu/jthaler</a>.</p>
---------------------------------------------------------------------
To unsubscribe, e-mail: commits-unsubscribe@datasketches.apache.org
For additional commands, e-mail: commits-help@datasketches.apache.org