On-line selection of \(c\)-alternating subsequences from a random sample (Q1952478): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Lawrence A. Shepp / rank
Normal rank
 
Property / author
 
Property / author: Lawrence A. Shepp / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59021424 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2013/623183 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2611199913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Selection of Alternating Subsequences from a Random Sample / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:10, 6 July 2024

scientific article
Language Label Description Also known as
English
On-line selection of \(c\)-alternating subsequences from a random sample
scientific article

    Statements

    On-line selection of \(c\)-alternating subsequences from a random sample (English)
    0 references
    0 references
    0 references
    0 references
    31 May 2013
    0 references
    Summary: A sequence \(X_1, X_2, \dots, X_n\) is a \(c\)-alternating sequence if any odd term is less than or equal to the next even term \(-c\) and if any even term is greater than or equal to the next odd term \(+c\), where \(c\) is a nonnegative constant. In this paper, we present an optimal on-line procedure to select a \(c\)-alternating subsequence from a symmetric distributed random sample. We also give the optimal selection rate when the sample size goes to infinity.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references