Results 1 to 10 of about 2,699,353 (198)
Connectivity of submodular functions [PDF]
Discrete Mathematics, 1992 This paper relates the connectivity of submodular functions \(f\) to that of certain submodular functions which are derived from \(f\). Here the function \(f\) on \(S\) is submodular if \(f(A)+f(B)\geq f(A\cup B)+f(A\cap B)\) for all subsets \(A\) and \(B\) of \(S\).
James G. Oxley, Geoff Whittle
openaire +3 more sources
Improved algorithms for submodular function minimization and submodular flow [PDF]
Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000 Very recently, two groups of researchers independently developed the first combinatorial, strongly polynomial-time algorithms for submodular function minimization (Iwata, Fleischer, Fujishige; and Schrijver). In this paper, we improve on these algorithms and show that the ideas generated in the design of these algorithms are helpful in other contexts ...
Lisa Fleischer, Satoru Iwata 0001
openaire +2 more sources
Fast and exact search for the partition with minimal information loss. [PDF]
PLoS ONE, 2018 In analysis of multi-component complex systems, such as neural systems, identifying groups of units that share similar functionality will aid understanding of the underlying structures of the system.
Shohei Hidaka, Masafumi Oizumi
doaj +1 more source
Two-Layer Network Caching for Different Service Requirements
Future Internet, 2021 Network caching is a technique used to speed-up user access to frequently requested contents in complex data networks. This paper presents a two-layer overlay network caching system for content distribution.
Gianluca Reali, Mauro Femminella
doaj +1 more source
Continuous submodular function maximization
CoRR, 2020 Continuous submodular functions are a category of generally non-convex/non-concave functions with a wide spectrum of applications. The celebrated property of this class of functions - continuous submodularity - enables both exact minimization and approximate maximization in poly. time.
Bian, Yatao; id_orcid0000-0002-2368-4084 +2 more
openaire +3 more sources
Hypergraph cuts with edge-dependent vertex weights
Applied Network Science, 2022 We develop a framework for incorporating edge-dependent vertex weights (EDVWs) into the hypergraph minimum s-t cut problem. These weights are able to reflect different importance of vertices within a hyperedge, thus leading to better characterized cut ...
Yu Zhu, Santiago Segarra
doaj +1 more source
Outbreak detection for temporal contact data
Applied Network Science, 2021 Epidemic spreading is a widely studied process due to its importance and possibly grave consequences for society. While the classical context of epidemic spreading refers to pathogens transmitted among humans or animals, it is straightforward to apply ...
Martin Sterchi +3 more
doaj +1 more source
CoRR, 2017 We start with an overview of a class of submodular functions called SCMMs (sums of concave composed with non-negative modular functions plus a final arbitrary modular). We then define a new class of submodular functions we call {\em deep submodular functions} or DSFs. We show that DSFs are a flexible parametric family of submodular functions that share
Jeffrey A. Bilmes, Wenruo Bai
openaire +2 more sources
Sparse Submodular Function Minimization
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023 Accepted to FOCS ...
Andrei Graur +2 more
openaire +4 more sources
Symmetric Submodular Functions, Uncrossable Functions, and Structural Submodularity
CoRRDiestel, et al. (see Order 35 (2017), JCT-A 167 (2019), arXiv:1805.01439) introduced the notion of abstract separation systems that satisfy a submodularity property, and they call this structural submodularity. Williamson, Goemans, Mihail, and Vazirani (Combinatorica 15 (1995)) call a family of sets $\mathcal{F}$ uncrossable if the following holds: for
Miles Simmons +2 more
openaire +3 more sources