Results 21 to 30 of about 517 (178)

Submodular partition functions

open access: yesDiscrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amini, Omid   +3 more
openaire   +3 more sources

Subquadratic submodular function minimization [PDF]

open access: yesProceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
Submodular function minimization (SFM) is a fundamental discrete optimization problem which generalizes many well known problems, has applications in various fields, and can be solved in polynomial time. Owing to applications in computer vision and machine learning, fast SFM algorithms are highly desirable. The current fastest algorithms [Lee, Sidford,
Deeparnab Chakrabarty   +3 more
openaire   +2 more sources

Concave Aspects of Submodular Functions [PDF]

open access: yes2020 IEEE International Symposium on Information Theory (ISIT), 2020
Submodular Functions are a special class of set functions, which generalize several information-theoretic quantities such as entropy and mutual information [1]. Submodular functions have subgradients and subdifferentials [2] and admit polynomial-time algorithms for minimization, both of which are fundamental characteristics of convex functions ...
Rishabh K. Iyer, Jeff A. Bilmes
openaire   +2 more sources

Submodular Functions are Noise Stable [PDF]

open access: yesProceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
We show that all non-negative submodular functions have high {\em noise-stability}. As a consequence, we obtain a polynomial-time learning algorithm for this class with respect to any product distribution on $\{-1,1\}^n$ (for any constant accuracy parameter $ε$). Our algorithm also succeeds in the agnostic setting.
Mahdi Cheraghchi   +3 more
openaire   +3 more sources

A new matroid constructed by the rank function of a matroid

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
In this article, we construct a submodular function using the rank function of a matroid and study induced matroid with constructed polymatroid, then we relate some properties of connectivity of new matroid with the main matroid.
Moein Pourbaba   +2 more
doaj   +1 more source

Quantitative approximation by nonlinear Angheluta-Choquet singular integrals

open access: yesJournal of Numerical Analysis and Approximation Theory, 2020
By using the concept of nonlinear Choquet integral with respect to a capacity and as a generalization of the Poisson-Cauchy-Choquet operators, we introduce the nonlinear Angheluta-Choquet singular integrals with respect to a family of submodular set ...
Sorin Gal, Ionut Iancu
doaj   +7 more sources

Mobility-Aware Traffic Offloading via Cooperative Coded Edge Caching

open access: yesIEEE Access, 2020
With caching popular contents at the small-cell base stations (SBSs), cooperative edge caching has emerged as an effective approach to offload explosively increasing network traffic from a massive number of users in mobile edge networks (MENs).
Dewang Ren   +3 more
doaj   +1 more source

Toward Optimal Placement of Spatial Sensors to Detect Poisson-Distributed Targets

open access: yesIEEE Access, 2023
This paper addresses the challenges of optimally placing a finite number of sensors to detect Poisson-distributed targets in a bounded domain. We seek to rigorously account for uncertainty in the target arrival model throughout the problem.
Mingyu Kim   +5 more
doaj   +1 more source

On the Reducibility of Submodular Functions

open access: yesCoRR, 2016
The scalability of submodular optimization methods is critical for their usability in practice. In this paper, we study the reducibility of submodular functions, a property that enables us to reduce the solution space of submodular optimization problems without performance loss. We introduce the concept of reducibility using marginal gains.
Jincheng Mei, Hao Zhang, Bao-Liang Lu
openaire   +3 more sources

Approximation Algorithm for the Single Machine Scheduling Problem with Release Dates and Submodular Rejection Penalty

open access: yesMathematics, 2020
In this paper, we consider the single machine scheduling problem with release dates and nonmonotone submodular rejection penalty. We are given a single machine and multiple jobs with probably different release dates and processing times. For each job, it
Xiaofei Liu, Weidong Li
doaj   +1 more source

Home - About - Disclaimer - Privacy