Stem submodular$ (all stems)

40 papers:

STOC-2015-KorulaMZ #online #order #random

Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (NK, VSM, MZ), pp. 889–898.

STOC-2015-MirrokniZ #composition #distributed #random

Randomized Composable Core-sets for Distributed Submodular Maximization (VSM, MZ), pp. 153–162.

ICALP-v1-2015-ChekuriGQ #algorithm #streaming

Streaming Algorithms for Submodular Function Maximization (CC, SG, KQ), pp. 318–330.

ICML-2015-BarbosaENW #dataset #distributed #power of

The Power of Randomization: Distributed Submodular Maximization on Massive Datasets (RdPB, AE, HLN, JW), pp. 1236–1244.

ICML-2015-EneN #coordination #random

Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions (AE, HLN), pp. 787–795.

ICML-2015-PachecoS #approach #pseudo

Proteins, Particles, and Pseudo-Max-Marginals: A Submodular Approach (JP, EBS), pp. 2200–2208.

ICML-2015-WeiIB #learning #set

Submodularity in Data Subset Selection and Active Learning (KW, RKI, JAB), pp. 1954–1963.

ICML-2015-YuB #learning

Learning Submodular Losses with the Lovasz Hinge (JY, MBB), pp. 1623–1631.

SIGIR-2015-MehrotraY #learning #query #rank #using

Representative & Informative Query Selection for Learning to Rank using Submodular Functions (RM, EY), pp. 545–554.

CIKM-2014-YangSR #recommendation

Constrained Question Recommendation in MOOCs via Submodularity (DY, JS, CPR), pp. 1987–1990.

CIKM-2014-ZhuSY #information retrieval #learning #taxonomy

Cross-Modality Submodular Dictionary Learning for Information Retrieval (FZ, LS, MY), pp. 1479–1488.

ICML-c1-2014-ChenSMKWK #adaptation #detection

Active Detection via Adaptive Submodularity (YC, HS, CFM, LPK, SW, AK), pp. 55–63.

ICML-c2-2014-WeiIB #multi #performance

Fast Multi-stage Submodular Maximization (KW, RKI, JAB), pp. 1494–1502.

KDD-2014-BadanidiyuruMKK #on the fly #streaming #summary

Streaming submodular maximization: massive data summarization on the fly (AB, BM, AK, AK), pp. 671–680.

ICML-c1-2013-ChenK #adaptation #learning #optimisation

Near-optimal Batch Mode Active Learning and Adaptive Submodular Optimization (YC, AK), pp. 160–168.

ICML-c3-2013-IyerJB #optimisation #performance

Fast Semidifferential-based Submodular Function Optimization (RKI, SJ, JAB), pp. 855–863.

ICML-c3-2013-ReedG #process #scalability

Scaling the Indian Buffet Process via Submodular Maximization (CR, ZG), pp. 1013–1021.

ICML-c3-2013-RossZYDB #learning #policy #predict

Learning Policies for Contextual Submodular Prediction (SR, JZ, YY, DD, DB), pp. 1364–1372.

PODS-2012-BorodinLY

Max-Sum diversification, monotone submodular functions and dynamic updates (AB, HCL, YY), pp. 155–166.

ICALP-v1-2012-AzarG #constraints #linear #performance

Efficient Submodular Function Maximization under Linear Packing Constraints (YA, IG), pp. 38–50.

ICALP-v1-2012-ImNZ #latency

Minimum Latency Submodular Cover (SI, VN, RvdZ), pp. 485–497.

CIKM-2012-SiposSSJ #corpus #summary #using #word

Temporal corpus summarization using submodular word coverage (RS, AS, PS, TJ), pp. 754–763.

ICML-2012-Gomez-RodriguezS12a #multi #network

Submodular Inference of Diffusion Networks from Multiple Trees (MGR, BS), p. 206.

STOC-2011-BalcanH #learning

Learning submodular functions (MFB, NJAH), pp. 793–802.

STOC-2011-Dobzinski #combinator

An impossibility result for truthful combinatorial auctions with submodular valuations (SD), pp. 139–148.

STOC-2011-VondrakCZ #multi

Submodular function maximization via the multilinear relaxation and contention resolution schemes (JV, CC, RZ), pp. 783–792.

ICALP-v1-2011-ChekuriE #problem

Submodular Cost Allocation Problem and Applications (CC, AE), pp. 354–366.

ICALP-v1-2011-FeldmanNS #algorithm

Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm — (Extended Abstract) (MF, JN, RS), pp. 342–353.

ICML-2011-DasK #algorithm #approximate #set #taxonomy

Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection (AD, DK), pp. 1057–1064.

ICML-2011-JegelkaB #combinator #online

Online Submodular Minimization for Combinatorial Structures (SJ, JAB), pp. 345–352.

ICML-2011-NaganoKA

Size-constrained Submodular Minimization through Minimum Norm Base (KN, YK, KA), pp. 977–984.

SIGIR-2011-LiLL #framework #multi #named #summary

MSSF: a multi-document summarization framework based on submodularity (JL, LL, TL), pp. 1247–1248.

ICML-2010-GuilloryB #interactive #set

Interactive Submodular Set Cover (AG, JAB), pp. 415–422.

ICML-2010-KrauseC #representation #taxonomy

Submodular Dictionary Selection for Sparse Representation (AK, VC), pp. 567–574.

STOC-2009-LeeMNS #constraints

Non-monotone submodular maximization under matroid and knapsack constraints (JL, VSM, VN, MS), pp. 323–332.

ICALP-v1-2009-KoufogiannakisY #algorithm #approximate #constraints

Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost (CK, NEY), pp. 634–652.

STOC-2008-Vondrak #approximate #problem

Optimal approximation for the submodular welfare problem in the value oracle model (JV), pp. 67–74.

STOC-2007-MosselR #network #on the #social

On the submodularity of influence in social networks (EM, SR), pp. 128–134.

STOC-2000-FleischerI #algorithm

Improved algorithms for submodular function minimization and submodular flow (LF, SI), pp. 107–116.

STOC-2000-IwataFF #algorithm #combinator #polynomial

A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (SI, LF, SF), pp. 97–106.