Constrained robust submodular sensor selection with applications to multistatic sonar arrays
暂无分享,去创建一个
Les E. Atlas | Jeff A. Bilmes | Thomas Powers | David W. Krout | J. Bilmes | Thomas Powers | L. Atlas | D. Krout
[1] Kenji Kashiwabara,et al. Matroid Representation of Clique Complexes , 2003, COCOON.
[2] Jan Vondrák,et al. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) , 2007, IPCO.
[3] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..
[4] Michel Minoux,et al. Accelerated greedy algorithms for maximizing submodular set functions , 1978 .
[5] Andreas Krause,et al. SFO: A Toolbox for Submodular Function Optimization , 2010, J. Mach. Learn. Res..
[6] Stephen P. Boyd,et al. Sensor Selection via Convex Optimization , 2009, IEEE Transactions on Signal Processing.
[7] Ian F. Akyildiz,et al. Sensor Networks , 2002, Encyclopedia of GIS.
[8] Thomas Powers,et al. Sensor management for multistatics , 2014, 17th International Conference on Information Fusion (FUSION).
[9] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[10] C. Bron,et al. Algorithm 457: finding all cliques of an undirected graph , 1973 .
[11] H. B. McMahan,et al. Robust Submodular Observation Selection , 2008 .
[12] 藤重 悟. Submodular functions and optimization , 1991 .
[13] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.
[14] Toshihiro Fujito,et al. Approximation algorithms for submodular set cover with applications , 2000 .
[15] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..
[16] Rishabh K. Iyer,et al. Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints , 2013, NIPS.
[17] Les E. Atlas,et al. Sensor selection from independence graphs using submodularity , 2015, 2015 18th International Conference on Information Fusion (Fusion).