A Coverage Theory of Bistatic Radar Networks: Worst-Case Intrusion Path and Optimal Deployment
Xiaowen GongJunshan ZhangDouglas CochranPublished in: CoRR (2012)
Keyphrases
- worst case
- greedy algorithm
- upper bound
- average case
- lower bound
- error bounds
- np hard
- intrusion detection
- theoretical framework
- social networks
- dynamic programming
- image processing
- measurement errors
- minimum cost
- approximation algorithms
- optimal solution
- multiscale
- computer networks
- image reconstruction
- anomaly detection
- synthetic aperture radar
- signal processing
- worst case analysis
- path selection
- received signal