Results 61 to 70 of about 6,397 (149)

Processing Succinct Matrices and Vectors

open access: yes, 2014
We study the complexity of algorithmic problems for matrices that are represented by multi-terminal decision diagrams (MTDD). These are a variant of ordered decision diagrams, where the terminal nodes are labeled with arbitrary elements of a semiring ...
A. Bertoni   +21 more
core   +1 more source

Complexity and Unwinding for Intransitive Noninterference [PDF]

open access: yes, 2013
The paper considers several definitions of information flow security for intransitive policies from the point of view of the complexity of verifying whether a finite-state system is secure. The results are as follows.
Eggert, Sebastian   +3 more
core  

mlf-core: a framework for deterministic machine learning. [PDF]

open access: yesBioinformatics, 2023
Heumos L   +7 more
europepmc   +1 more source

Non-Malleable Code in the Split-State Model. [PDF]

open access: yesEntropy (Basel), 2022
Aggarwal D, Ball M, Obremski M.
europepmc   +1 more source

Multiple sequence alignment based on deep reinforcement learning with self-attention and positional encoding. [PDF]

open access: yesBioinformatics, 2023
Liu Y   +6 more
europepmc   +1 more source

Redundancy in distributed proofs. [PDF]

open access: yesDistrib Comput, 2021
Feuilloley L   +4 more
europepmc   +1 more source

Multiset multicover methods for discriminative marker selection. [PDF]

open access: yesCell Rep Methods, 2022
Hasanaj E   +4 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy