Results 111 to 120 of about 5,397,625 (216)
Applied Sciences, 2019 Competitive Influence Maximization ( CIM ) problem, which seeks a seed set nodes of a player or a company to propagate their product’s information while at the same time their competitors are conducting similar strategies, has been paid much ...
Canh V. Pham +3 more
doaj +1 more source
A note on submodular function minimization by Chubanov’s LP algorithm [PDF]
, 2019 Recently Dadush et al. (2017) have devised a polynomial submodular function minimization (SFM) algorithm based on their LP algorithm. In the present note we also show a weakly polynomial algorithm for SFM based on the recently developed linear ...
Fujishige, Satoru
core +1 more source
On the Non-Submodularity of the Problem of Adding Links to Minimize the Effective Graph Resistance
Journal of Graph Algorithms and ApplicationsWe consider the optimisation problem of adding $k$ links to a given network, such that the resulting effective graph resistance is as small as possible.
Massimo A. Achterberg, Robert E. Kooij
doaj +1 more source
Submodular functions in graph theory
Discrete Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Dynamic Stepsize Techniques in DR-Submodular Maximization
MathematicsThe Diminishing-Return (DR)-submodular function maximization problem has garnered significant attention across various domains in recent years. Classic methods often employ continuous greedy or Frank–Wolfe approaches to tackle this problem; however, high
Yanfei Li, Min Li, Qian Liu, Yang Zhou
doaj +1 more source
Multimodal Hierarchical Dirichlet Process-Based Active Perception by a Robot
Frontiers in Neurorobotics, 2018 In this paper, we propose an active perception method for recognizing object categories based on the multimodal hierarchical Dirichlet process (MHDP). The MHDP enables a robot to form object categories using multimodal information, e.g., visual, auditory,
Tadahiro Taniguchi +2 more
doaj +1 more source
A capacity scaling algorithm for convex cost submodular flows
, 1997 This paper presents a scaling scheme for submodular functions. A small but strictly submodular function is added before scaling so that the resulting functions should be submodular.
Iwata, Satoru
core +1 more source
Robust team assignment and scheduling for scalable digital art collaboration [PDF]
PeerJ Computer ScienceCollaborative digital content creation in multi-stage artistic workflows requires effective coordination among heterogeneous creators and shared computational resources. However, many existing approaches overlook key constraints, such as cross-stage team
Di Wu, Yong Li
doaj +2 more sources
Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints
, 2013 We investigate two new optimization problems — minimizing a submodular function subject to a submodular lower bound constraint (submodular cover) and maximizing a submodular function subject to a submodular upper bound constraint (submodular knapsack ...
Rishabh Iyer, Jeff Bilmes
core
Extended Deep Submodular Functions
Trans. Mach. Learn. Res.We introduce a novel category of set functions called Extended Deep Submodular functions (EDSFs), which are neural network-representable. EDSFs serve as an extension of Deep Submodular Functions (DSFs), inheriting crucial properties from DSFs while addressing innate limitations.
Seyed Mohammad Hosseini +4 more
openaire +3 more sources