Greedy sensor selection: Leveraging submodularity
By Manohar Shamaiah, Siddhartha Banerjee, Haris Vikalo. IEEE Conference on Decision and Control, 2010
320 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/449fdef8f92c8631b3a5a15f1708a136246f3ce3
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Computer Networks and Communications
Citations in the corpus
- FLASH: Fast Bayesian Optimization for Data Analytic Pipelines (2016, background): “(3) appears in other fields such as optimal facility location and sensor planning where greedy algorithm is known to have a 1− 1 e approximation guarantee [8, 40].”
- Submodularity in Data Subset Selection and Active Learning (2015, methodology): “…chosen as the surrogate model to measure the utility of each subset for an underlying task (Shinohara, 2014; Zheng et al., 2014; Hoi et al., 2006; Shamaiah et al., 2010; Prasad et al., 2014; Krause et al., 2008; Das & Kempe, 2011; Wei et al., 2014b; Kempe et al., 2003; Gabillon et al., 2013;…”