Skip to search formSkip to main contentSkip to account menu

Submodular set function

Known as: Submodular, Submodular function 
In mathematics, a submodular set function (also known as a submodular function) is a set function whose value, informally, has the property that the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

33 relations
Active learning (machine learning)Alexander SchrijverArtificial intelligenceAutomatic summarization

Broader (1)

Combinatorial optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Feature Selection for Classification under Anonymity Constraint
Over the last decade, proliferation of various online platforms and their increasing adoption by billions of users have… 
2011
2011
Submodular decomposition framework for inference in associative Markov networks with global constraints
In this paper we address the problem of finding the most probable state of discrete Markov random field (MRF) with associative… 
2011
2011
Local phy + global flow: A layering principle for wireless networks
A classical result in undirected wireline networks is the near optimality of routing (flow) for multiple-unicast: the min cut… 
2010
2010
Generating secret in a network
This monograph studies the theory of information through the multiuser secret key agreement problem. A general notion of mutual… 
2010
2010
Automated Segmentation of 3D CT Images Based on Statistical Atlas and Graph Cuts
This paper presents an effective combination of a statistical atlasbased approach and a graph cuts algorithm for fully automated… 
2008
2008
Which submodular functions are expressible using binary submodular functions
Submodular functions occur in many combinatorial optimisation problems and a number of polynomial-time algorithms have been… 
2008
2008
Classes of submodular constraints expressible by graph cuts
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It… 
Review
2000
Review
2000
Algorithms for submodular flows
The submodular flow problem, introduced by Edmonds and Giles [11], is one of the most important frameworks of efficiently… 
2000
2000
Structural Aspects of Ordered Polymatroids
Highly Cited
1988
Highly Cited
1988
Directed submodularity, ditroids and directed submodular flows
Set relations and operations such as inclusion, union and intersection are generalized to directed subsets whose elements are… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)