Efficient blind search: optimal power of detection under computational cost constraints (Q1018599)
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: Efficient blind search: optimal power of detection under computational cost constraints |
scientific article; zbMATH DE number 5555681
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient blind search: optimal power of detection under computational cost constraints |
scientific article; zbMATH DE number 5555681 |
Statements
Efficient blind search: optimal power of detection under computational cost constraints (English)
0 references
20 May 2009
0 references
multiple testing
0 references
group testing
0 references
dynamic programming
0 references
pulsar detection
0 references
0.6547152996063232
0 references
0.6530941724777222
0 references
0.6485350131988525
0 references
0.6398676633834839
0 references
0.6396409273147583
0 references
