暂无分享,去创建一个
Andreas Krause | Baharan Mirzasoleiman | Amin Karbasi | Jan Vondrák | Ashwinkumar Badanidiyuru | Andreas Krause | J. Vondrák | Baharan Mirzasoleiman | Ashwinkumar Badanidiyuru | Amin Karbasi
[1] Laurence A. Wolsey,et al. Best Algorithms for Approximating the Maximum of a Submodular Set Function , 1978, Math. Oper. Res..
[2] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[3] Michel Minoux,et al. Accelerated greedy algorithms for maximizing submodular set functions , 1978 .
[4] Peter J. Rousseeuw,et al. Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .
[5] U. Feige. A threshold of ln n for approximating set cover , 1998, JACM.
[6] Andreas Krause,et al. Near-optimal Nonmyopic Value of Information in Graphical Models , 2005, UAI.
[7] Andreas Krause,et al. Cost-effective outbreak detection in networks , 2007, KDD '07.
[8] Brendan J. Frey,et al. Non-metric affinity propagation for unsupervised image categorization , 2007, 2007 IEEE 11th International Conference on Computer Vision.
[9] Antonio Torralba,et al. Ieee Transactions on Pattern Analysis and Machine Intelligence 1 80 Million Tiny Images: a Large Dataset for Non-parametric Object and Scene Recognition , 2022 .
[10] Avi Ostfeld,et al. The Battle of the Water Sensor Networks (BWSN): A Design Challenge for Engineers and Algorithms , 2008 .
[11] Andreas Krause,et al. Efficient Sensor Placement Optimization for Securing Large Water Distribution Networks , 2008 .
[12] Dafna Shahaf,et al. Turning down the noise in the blogosphere , 2009, KDD.
[13] Ravi Kumar,et al. Max-cover in map-reduce , 2010, WWW '10.
[14] Max A. Little,et al. Enhanced classical dysphonia measures and sparse regression for telemonitoring of Parkinson's disease progression , 2010, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing.
[15] Hui Lin,et al. Multi-document Summarization via Budgeted Maximization of Submodular Functions , 2010, NAACL.
[16] Andreas Krause,et al. Budgeted Nonparametric Learning from Data Streams , 2010, ICML.
[17] Carlos Guestrin,et al. Beyond keyword search: discovering relevant scientific literature , 2011, KDD.
[18] Andreas Krause,et al. Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization , 2010, J. Artif. Intell. Res..
[19] Andreas Krause,et al. Submodularity and its applications in optimized information gathering , 2011, TIST.
[20] Jeff A. Bilmes,et al. Active Semi-Supervised Learning using Submodular Functions , 2011, UAI.
[21] Guy E. Blelloch,et al. Linear-work greedy parallel approximate set cover and variants , 2011, SPAA '11.
[22] Hui Lin,et al. A Class of Submodular Functions for Document Summarization , 2011, ACL.
[23] Jure Leskovec,et al. Inferring Networks of Diffusion and Influence , 2012, ACM Trans. Knowl. Discov. Data.
[24] Thorsten Joachims,et al. Temporal corpus summarization using submodular word coverage , 2012, CIKM '12.
[25] Jure Leskovec,et al. Inferring networks of diffusion and influence , 2010, KDD.
[26] Andreas Krause,et al. Distributed Submodular Maximization: Identifying Representative Elements in Massive Data , 2013, NIPS.
[27] Jeff A. Bilmes,et al. Using Document Summarization Techniques for Speech Data Subset Selection , 2013, NAACL.
[28] Anirban Dasgupta,et al. Summarization Through Submodularity and Dispersion , 2013, ACL.
[29] Andreas Krause,et al. Streaming submodular maximization: massive data summarization on the fly , 2014, KDD.
[30] Rishabh K. Iyer,et al. Fast Multi-stage Submodular Maximization , 2014, ICML.
[31] Jan Vondrák,et al. Fast algorithms for maximizing submodular functions , 2014, SODA.
[32] Éva Tardos,et al. Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..
[33] Sergei Vassilvitskii,et al. Fast greedy algorithms in mapreduce and streaming , 2013, SPAA.
[34] Gorjan Alagic,et al. #p , 2019, Quantum information & computation.