Primer design through submodular function estimation. [PDF]
Chen Y +6 more
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
Budget-Aware Routing for Long Clinical Text. [PDF]
Qureshi K, Martin G, Peng Y.
europepmc +1 more source
Nonnegative definite hermitian matrices with increasing principal minors
Friedland Shmuel
doaj +1 more source
Functional muscle networks as biomarkers of post-stroke motor impairment and therapeutic responsiveness. [PDF]
O'Reilly D +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
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
Link-based influence maximization in networks of health promotion professionals. [PDF]
Oostenbroek MHW +4 more
europepmc +1 more source
Probing transcription factor subsets in gene regulatory networks. [PDF]
Geis L +4 more
europepmc +1 more source

