SFO: A Toolbox for Submodular Function Optimization
暂无分享,去创建一个
[1] Jeff A. Bilmes,et al. PAC-learning Bounded Tree-width Graphical Models , 2004, UAI.
[2] Andreas Krause,et al. Cost-effective outbreak detection in networks , 2007, KDD '07.
[3] Michel Minoux,et al. Accelerated greedy algorithms for maximizing submodular set functions , 1978 .
[4] C. Guestrin,et al. Near-optimal sensor placements: maximizing information while minimizing communication cost , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.
[5] Vladimir Kolmogorov,et al. What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[6] Vahab Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2007, FOCS 2007.
[7] Andreas Krause,et al. Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..
[8] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[9] Jeff A. Bilmes,et al. Q-Clustering , 2005, NIPS.
[10] G. A. Tijssen,et al. The Data-Correcting Algorithm for the Minimization of Supermodular Functions , 1999 .
[11] Jeff A. Bilmes,et al. A Submodular-supermodular Procedure with Applications to Discriminative Structure Learning , 2005, UAI.
[12] 藤重 悟. Submodular functions and optimization , 1991 .
[13] Andreas Krause,et al. Simultaneous placement and scheduling of sensors , 2009, 2009 International Conference on Information Processing in Sensor Networks.
[14] Vahab S. Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2011, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[15] Toshihide Ibaraki,et al. Greedy splitting algorithms for approximating multiway partition problems , 2005, Math. Program..
[16] Maurice Queyranne,et al. A combinatorial algorithm for minimizing symmetric submodular functions , 1995, SODA '95.