greedy algorithm

Blocking Bandits NeurIPS 2019 Combinatorial Algorithms for Optimal Design COLT 2019 Complete Search for Feature Selection in Decision Trees JMLR 2019 Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm ICML 2019 Coverage Centrality Maximization in Undirected Networks AAAI 2019 Discovering Reliable Dependencies from Data: Hardness and Improved Algorithms IJCAI 2019 Fast Parallel Algorithms for Statistical Subset Selection Problems NeurIPS 2019 Generating Natural Language Adversarial Examples through Probability Weighted Word Saliency ACL 2019 Greedy and IHT Algorithms for Non-convex Optimization with Monotone Costs of Non-zeros AISTATS 2019 Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints AAAI 2019 Greedy Orthogonal Pivoting Algorithm for Non-Negative Matrix Factorization ICML 2019 Greedy Sampling for Approximate Clustering in the Presence of Outliers NeurIPS 2019 Greedy Structure Learning of Hierarchical Compositional Models CVPR 2019 Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time NeurIPS 2019 Migration as Submodular Optimization AAAI 2019 Pareto Optimization for Subset Selection with Dynamic Cost Constraints AAAI 2019 Profit-driven Task Assignment in Spatial Crowdsourcing IJCAI 2019 Sequential Facility Location: Approximate Submodularity and Greedy Algorithm ICML 2019 Submodular Cost Submodular Cover with an Approximate Oracle ICML 2019 Submodular Observation Selection and Information Gathering for Quadratic Models ICML 2019 Submodular Optimization over Streams with Inhomogeneous Decays AAAI 2019 Subspace Selection via DR-Submodular Maximization on Lattices AAAI 2019 Accelerating Greedy Coordinate Descent Methods ICML 2018 A Novel Strategy for Active Task Assignment in Crowd Labeling IJCAI 2018 Approximate Submodularity and its Applications: Subset Selection, Sparse Approximation and Dictionary Selection JMLR 2018