Old Web
English
Sign In
Acemap
>
Paper
>
On the Complexity and Approximability of Optimal Sensor Selection and Attack for Kalman Filtering
On the Complexity and Approximability of Optimal Sensor Selection and Attack for Kalman Filtering
2020
Lintao Ye
Nathaniel Woodford
Sandip Roy
Shreyas Sundaram
Hai Lin
James C. Spall
Keywords:
sensor selection
Machine learning
Artificial intelligence
Kalman filter
Psychology
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]