Sliding-window aggregation is a widely-used approach for extracting insights from the most recent portion of a data stream. Most aggregation operations of interest can be cast as binary operators that are associative, but not necessarily commutative nor invertible. However, non-invertible operators are nontrivial to support efficiently. The best existing algorithms for this setting require Oplo...

I read with great interest the recent article by DELCROIX et al. [1] on vascular and right ventricular remodelling in chronic thromboembolic pulmonary hypertension (CTEPH). I found it very informative; however, I would like to comment on some of the statements that were made. In relation to pulmonary vascular remodelling, the authors have stated that in spite of there being proportionally more ...

Sampling from a discrete Gaussian distribution is an indispensable part of lattice-based cryptography. Several recent works have shown that the timing leakage from a non-constant-time implementation of the discrete Gaussian sampling algorithm could be exploited to recover the secret. In this paper, we propose a constant-time implementation of the Knuth-Yao random walk algorithm for performing c...

11 (a) (b) (c) (d) (e) (f) Figure 6: Using Gaussian ltering to warp an image: (a) A s a m p l e 256 256 pixel black and white checkerboard image. Each colored square in the image has 8 8 pixels. (b) Point sampled w a r p o f (a) with warp functions x(uu v) = 256u=v, y(uu v) = v. (c) Gaussian kernel shapes required to lter the warp at some texture p ositions. The ellipses are tri-parametric-(aa ...