نتایج جستجو برای: average run length

تعداد نتایج: 756615  

Journal: :Theor. Comput. Sci. 2010
Alberto Apostolico Péter L. Erdös Alpár Jüttner

Parameterized matching between two strings occurs when it is possible to reduce the first one to the second by a renaming of the alphabet symbols. We present an algorithm for searching for parameterized occurrences of a patten in a textstring when both are given in run-length encoded form. The proposed method extends to alphabets of arbitrary yet constant size with O (|rp| × |rt|) time bounds, ...

Journal: :IEEE Trans. Information Theory 2000
Søren Forchhammer Jørn Justesen

Bounds on the capacity of constrained two-dimensional (2-D) codes are presented. The bounds of Calkin and Wilf apply to first-order symmetric constraints. The bounds are generalized in a weaker form to higher order and nonsymmetric constraints. Results are given for constraints specified by run-length limits or a minimum distance between pixels of a given value.

1990
Peter W. Glynn

We show that there is no batch-means estimation procedure for consistently estimating the asymptotic variance when the number of batches is held fixed as the run length increases. This result suggests that the number of batches should increase as the run length increases for sequential stopping rules based on batch means.

2002
Yong Guan Xinwen Fu Riccardo Bettati Wei Zhao

For many Internet applications, the ability to protect the identity of participants in a distributed applications is critical. For such applications, a number of anonymous communication systems have been realized over the recent years. The effectiveness of these systems relies greatly on the way messages are routed among the participants. (We call this the route selection strategy.) In this pap...

Journal: :Discrete Mathematics & Theoretical Computer Science 2010
Geneviève Paquin

In a recent paper, Brlek, Jamet and Paquin showed that some extremal infinite smooth words are also infinite Lyndon words. This result raises a natural question: are they the only ones? If no, what do the infinite smooth words that are also Lyndon words look like? In this paper, we give the answer, proving that the only infinite smooth Lyndon words are m{a<b}, with a, b even, m{1<b} and ∆ −1 1 ...

2016
Yupaporn Areepong Saowanit Sukparungsee

In this paper we propose the explicit formulas of Average Run Length (ARL) of Exponentially Weighted Moving Average (EWMA) control chart for Autoregressive Integrated Moving Average: ARIMA (p,d,q) (P, D, Q)L process with exponential white noise. To check the accuracy, the ARL results were compared with numerical integral equations based on the Gauss-Legendre rule. There was an excellent agreeme...

Journal: :Mathematical and Computer Modelling 1993

Journal: :The Journal of the Institute of Television Engineers of Japan 1991

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید