Sequential Change-Point Detection Procedures That are Nearly Optimal and Computationally Simple (Q3543508)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sequential Change-Point Detection Procedures That are Nearly Optimal and Computationally Simple |
scientific article; zbMATH DE number 5377319
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sequential Change-Point Detection Procedures That are Nearly Optimal and Computationally Simple |
scientific article; zbMATH DE number 5377319 |
Statements
Sequential Change-Point Detection Procedures That are Nearly Optimal and Computationally Simple (English)
0 references
4 December 2008
0 references
asymptotic optimality
0 references
average run length
0 references
change-point detection
0 references
0 references
0 references
0 references
0.813798189163208
0 references
0.8114767670631409
0 references
0.8070379495620728
0 references
