Efficient blind search: Optimal power of detection under computational cost constraints
Some astronomy projects require a blind search through a vast number of hypotheses to detect objects of interest. The number of hypotheses to test can be in the billions. A naive blind search over every single hypothesis would be far too costly computationally. We propose a hierarchical scheme for b...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
2007
|