Results 271 to 280 of about 152,864 (305)
Some of the next articles are maybe not open access.
Stepsize Sequence Design for Distributed Average Consensus
IEEE Signal Processing Letters, 2010Starting from local observations, iterative consensus algorithms attempt to drive a sensor network to a common estimate in a decentralized, incremental manner. When additive noise perturbs the sensor exchanges, a decreasing stepsize guarantees convergence under certain conditions, although the design of such stepsize sequence for fastest convergence is
Carlos Mosquera +2 more
openaire +1 more source
Delayed averages of mixing sequences
Canadian Journal of Statistics, 1977AbstractWe obtain a limit theorem for stationary, mixing sequences of random variables.
openaire +2 more sources
Averaging video sequences to improve action recognition
2016 9th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI), 2016Sequence matching/alignment based scheme has been common for action recognition. Such a typical scheme, however, requires tremendous amounts of computation when the volume of prototypical action videos is large and easily causes mismatching for border-isolated samples in action categories.
Zhen Gao, Guoliang Lu, Peng Yan 0001
openaire +1 more source
On the harmonic averages of numerical sequences
Archiv der Mathematik, 2006In recent years, the almost sure central limit theorem attracted widespread attention in Probability Theory. It involves the harmonic (also called logarithmic) averages of a certain numerical sequence formed from a sequence of independent, identically distributed random variables.
openaire +1 more source
Average cost expansion sequencing
Operations Research Letters, 1989zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Ergodic sequences of averages of group representations
Ergodic Theory and Dynamical Systems, 1994AbstractLet G be a locally compact σ -compact group with right Haar measure λ. A sequence {μn} of probabilities on G is called ergodic if for every f ∈ L1(G, λ) and t ∈ G we have ‖μn* (f − δt* f) ‖1 → 0. If T (t) is a bounded continuous representation of G by linear operators in a Banach space X, we define the μ,-average of T(t) by .
Lin, Michael, Wittmann, Rainer
openaire +2 more sources
On weighted averages of double sequences
2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fazekas, István, Tómács, Tibor
openaire +2 more sources
Random Sequences, Series, and Averages
2002Moments and tails, convergence a.s. and in probability, sub-sequence criterion, continuity and completeness, convergence in distribution, tightness and uniform integrability, convergence of means, Lp-convergence, random series and averages, positive and symmetric terms, variance criteria, three-series criterion, strong laws of large numbers, empirical ...
openaire +1 more source
On Mixing Conditions for Sequences of Moving Averages
Theory of Probability & Its Applications, 2010We study whether moving average sequences satisfy classical mixing conditions concerning cases of independent and dependent innovations. In particular, a class of not m-dependent moving averages is given which satisfies the strong mixing condition. Also for some classes of moving averages the absence of mixing is proved.
openaire +1 more source