Results 261 to 270 of about 152,864 (305)
Summarizing a set of time series by averaging: From Steiner sequence to compact multiple alignment
Theoretical Computer Science, 2012 Summarizing a set of sequences is an old topic that has been revived in the last decade, due to the increasing availability of sequential datasets. The definition of a consensus object is on the center of data analysis issues, since it crystallizes the ...
François Petitjean, Pierre Gancarski
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the Average Sequence Complexity
Data Compression Conference, 2004. Proceedings. DCC 2004, 2004This paper discusses the measure of complexity of a sequence called the complexity index. The complexity index captures the "richness of the language" used in a sequence. The measure is simple but quite intuitive. Sequences with low complexity index contain a large number of repeated substrings and they eventually become periodic (e.g., tandem repeats ...
Svante Janson +2 more
openaire +1 more source
The Mathematical Gazette, 1986
A very simple way of generating a sequence is to take two starting values, a 1 and a 2 , and construct a 3 as their arithmetic mean ...
Jim Gowers +2 more
openaire +1 more source
A very simple way of generating a sequence is to take two starting values, a 1 and a 2 , and construct a 3 as their arithmetic mean ...
Jim Gowers +2 more
openaire +1 more source
On Subsequential Averages of Sequences in Banach Spaces
Real Analysis Exchange, 2023This paper gives a strong contribution to the solution to the conjecture described next. Conjecture 1. Let \(\mathcal{X}\) be a Banach space, and suppose that \(x=\{x_n\}_{n=0}^{\infty}\subseteq\mathcal{X}\). Then the set \[\overline{x}^c=\left\{y\in\mathcal{X}: \exists \text{ a strictly increasing sequence } \{k_n\}\text{ s.t.
openaire +1 more source
Exponent of Convergence of a Sequence of Ergodic Averages
Mathematical Notes, 2022The author studies exponents of convergence for a sequence of ergodic averages for ergodic measure-preserving non-necessary invertible dynamical systems. Criteria for the boundary values \(1\) and \(\infty\) of the exponent of convergence are given. Additionally, functions cohomologous to zero with a given exponent of convergence are described.
openaire +1 more source
Mining interesting sequences with low average cost and high average utility
Applied Intelligence, 2021Discovering high utility sequences in a quantitative database is a popular data mining task. The goal is to enumerate all sequences of items (symbols) that have a high value for the user, as measured by a utility function. A representative application of high utility sequence mining is the identification of profitable sequences of purchases in ...
Tin C. Truong +4 more
openaire +1 more source
The Mathematical Gazette, 1994
Starting with a finite set of numbers { x l , x 2 , x 3 , …, x n
openaire +1 more source
Starting with a finite set of numbers { x l , x 2 , x 3 , …, x n
openaire +1 more source
On the convergence of averages of mixing sequences
Journal of Theoretical Probability, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bryc, W., Smolenski, W.
openaire +1 more source
Tongue motion averaging from contour sequences
Clinical Linguistics & Phonetics, 2005In this paper, a method to get the best representation of a speech motion from several repetitions is presented. Each repetition is a representation of the same speech captured at different times by sequence of ultrasound images and is composed of a set of 2D spatio-temporal contours. These 2D contours in different repetitions are time aligned first by
Min, Li +2 more
openaire +2 more sources
Characterization of the convergence of weighted averages of sequences and functions
Periodica Mathematica Hungarica, 2012Let \(p_k \geq 0\), \(k = 1,2,\dots\), and \(P_n := \sum^n_{k=1} p_k \to \infty\) as \(n \to \infty\). The weighted averages of the sequence \((c_k)\) with respect to the weights \((p_k)\) are defined by \[ \sigma_n :=\frac{1}{ P_n} \sum^n_{k=1} p_k c_k. \] Under some assumptions on the weights, necessary and sufficient conditions are given such that \(
Ferenc Móricz, Ulrich Stadtmüller
openaire +1 more source