Improvement of Nociceptive Spike Clusterization with Shape Approximation of calculations, we explored the prior
approximation of spike shapes before applying clusterization. The prior
Об аппроксимативных числах двумерного прямоугольного оператора ХардиUpper and lower bounds are obtained for the
approximation numbers of the two
Programming of an approximating K-ary GCD algorithmIn our paper, we consider the procedure for effective programming of an
approximating k-ary GCD
Flat cyclic Fréchet modules, amenable Fréchet algebras, and approximate identities and Sheinberg. To this end, we introduce a notion of "locally bounded
approximate identity" (a locally b
Heavy outgoing call asymptotics for MMPP/M/1/1 retrial queue with two-way communication idle time. Our contribution is to derive the asymptotics of the
number of calls in retrial queue under