On-Line Selection ofc-Alternating Subsequences from a Random Sample | Zendy

Robert W. Chen | Zendy; L. A. Shepp | Zendy; Justín Ju-Chen Yang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On-Line Selection ofc-Alternating Subsequences from a Random Sample

Author(s) -

Robert W. Chen,

L. A. Shepp,

Justín Ju-Chen Yang

Publication year - 2013

Publication title -

journal of probability and statistics

Language(s) - English

Resource type - Journals

eISSN - 1687-9538

pISSN - 1687-952X

DOI - 10.1155/2013/623183

Subject(s) - subsequence , mathematics , term (time) , selection (genetic algorithm) , sequence (biology) , sample (material) , constant (computer programming) , line (geometry) , combinatorics , infinity , random sequence , statistics , computer science , mathematical analysis , artificial intelligence , distribution (mathematics) , chemistry , physics , geometry , chromatography , quantum mechanics , biology , bounded function , genetics , programming language

A sequence is a -alternating sequence if any odd term is less than or equal to the next even term and the any even term is greater than or equal to the next odd term , where is a nonnegative constant. In this paper, we present an optimal on-line procedure to select a -alternating subsequence from a symmetric distributed randomsample. We also give the optimal selection rate when the sample size goes to infinity

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research