Results 11 to 20 of about 2,382 (289)
Bell-shaped nonstationary refinable ripplets [PDF]
We study the approximation properties of the class of nonstationary refinable ripplets introduced in \cite{GP08}. These functions are solution of an infinite set of nonstationary refinable equations and are defined through sequences of scaling masks that
Pitolli, Francesca
core +2 more sources
Polar Codes for Distributed Hierarchical Source Coding [PDF]
We show that polar codes can be used to achieve the rate-distortion functions in the problem of hierarchical source coding also known as the successive refinement problem.
Barg, Alexander, Ye, Min
core +1 more source
Refining One Theorem For The Romanovsky Distribution [PDF]
The paper considered a refinement of the theorem for a negative-hypergeometric distribution( the Romanovsky distribution), i.e., convergence over variation of the Romanovsky distribution by Erlang distributions. The theorem is proved by the direct asymptotic method.
Yusupova A.K., Gafforov R.A.
openaire +1 more source
Diagonal invariants and the refined multimahonian distribution [PDF]
Combinatorial aspects of multivariate diagonal invariants of the symmetric group are studied. As a consequence it is proved the existence of a multivariate extension of the classical Robinson-Schensted correspondence. Further byproduct are a pure combinatorial algorithm to describe the irreducible decomposition of the tensor product of two irreducible ...
openaire +2 more sources
On the equivalence of probability spaces [PDF]
For a general class of Gaussian processes $W$, indexed by a sigma-algebra $\mathscr F$ of a general measure space $(M,\mathscr F, \sigma)$, we give necessary and sufficient conditions for the validity of a quadratic variation representation for such ...
Alpay, Daniel +2 more
core +3 more sources
Distributed Gram-Schmidt orthogonalization with simultaneous elements refinement [PDF]
We present a novel distributed QR factorization algorithm for orthogonalizing a set of vectors in a decentralized wireless sensor network. The algorithm is based on the classical Gram-Schmidt orthogonalization with all projections and inner products reformulated in a recursive manner.
Slučiak, Ondrej +3 more
openaire +2 more sources
Refined Kolmogorov inequalities for the binomial distribution
This paper presents refined versions of the well-known Kolmogorov maximal inequality for the binomial distribution.
Antonini, Rita Giuliano +2 more
openaire +1 more source
Accuracy of several multidimensional refinable distributions
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heil, C., Cabrelli, C., Molter, U.
openaire +1 more source
Incremental refinement of image salient-point detection [PDF]
Low-level image analysis systems typically detect "points of interest", i.e., areas of natural images that contain corners or edges. Most of the robust and computationally efficient detectors proposed for this task use the autocorrelation matrix of the ...
Andreopoulos, Y, Patras, I
core +2 more sources
Multiresolution vector quantization [PDF]
Multiresolution source codes are data compression algorithms yielding embedded source descriptions. The decoder of a multiresolution code can build a source reproduction by decoding the embedded bit stream in part or in whole.
Dugatkin, Diego, Effros, Michelle
core +2 more sources

