Information Inequalities via Submodularity and a Problem in Extremal Graph Theory. [PDF]
Sason I.
europepmc +1 more source
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 devised to minimise such functions. The time complexity of the fastest known general algorithm for submodular function minimisation (SFM) is O(n^6+n^5L), where n is the number of variables and L is the time required to evaluate ...
Živný, S, Jeavons, P
openaire +2 more sources
GA-AFedOD: gradient-aligned active federated learning for resource-aware object detection in edge industrial IoT. [PDF]
Wang Z, Yuan X, Chen J.
europepmc +1 more source
Infodemic Source Detection with Information Flow: Foundations and Scalable Computation. [PDF]
Wang Z, Zhao C, Zhou Q, Tan CW, Chan C.
europepmc +1 more source
Identifying representative sequences of protein families using submodular optimization. [PDF]
Nguyen H +5 more
europepmc +1 more source
On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms. [PDF]
Yang Y, Chen PA, Lee YC, Fanchiang YY.
europepmc +1 more source
The Ground-Set-Cost Budgeted Maximum Coverage Problem. [PDF]
van Heuven van Staereling I +2 more
europepmc +1 more source
Shooting Utility Maximization in UAV-Assisted Wireless Camera Sensor Networks. [PDF]
Wu Y, Feng S, Dong C, Wang W.
europepmc +1 more source
A deep reinforcement learning framework for influence maximization problem on large-scale social networks. [PDF]
Yang F +5 more
europepmc +1 more source
Probing transcription factor subsets in gene regulatory networks. [PDF]
Geis L +4 more
europepmc +1 more source

