1 citations · 1 across the 5 of their papers we have counts for
5 papers · 1 filter
Online change-point detection for a transient change
Jack Noonan
We consider a popular online change-point problem of detecting a transient change in distributions of i.i.d. random variables. For this change-point problem, several change-point p…
Non-lattice covering and quanitization of high dimensional sets
Jack Noonan, Anatoly Zhigljavsky
The main problem considered in this paper is construction and theoretical study of efficient -point coverings of a -dimensional cube . Targeted values of are be…
Covering of high-dimensional cubes and quantization
Anatoly Zhigljavsky, Jack Noonan
As the main problem, we consider covering of a -dimensional cube by balls with reasonably large (10 or more) and reasonably small , like or . We do no…
Approximations for the boundary crossing probabilities of moving sums of random variables
Jack Noonan, Anatoly Zhigljavsky
In this paper we study approximations for the boundary crossing probabilities of moving sums of i.i.d. normal r.v. We approximate a discrete time problem with a continuous time pro…
Approximations for the boundary crossing probabilities of moving sums of normal random variables
Jack Noonan, Anatoly Zhigljavsky
In this paper we study approximations for boundary crossing probabilities for the moving sums of i.i.d. normal random variables. We propose approximating a discrete time problem wi…