Results 111 to 120 of about 517 (178)

Which submodular functions are expressible using binary submodular functions?

open access: yes, 2016
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

Understanding mental health discourse on Reddit with transformers and explainability. [PDF]

open access: yesSci Rep
Sánchez Rodríguez I   +6 more
europepmc   +1 more source

Attaining Fairness in Communication for Omniscience. [PDF]

open access: yesEntropy (Basel), 2022
Ding N   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy