A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks.

Eyal Weiss Michael Margaliot

Published in: CoRR (2017)

Keyphrases

worst case
learning algorithm
np hard
expectation maximization
k means
dynamic programming
neural network
high dimensional
probabilistic model
nearest neighbor
graphical models