In this work we study linear secret sharing schemes for s-t connectivity in directed graphs. In such schemes the parties are edges of a complete directed graph, and a set of partie...
: We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no fini...
The SCOP (Structural Classification of Proteins) database is a comprehensive ordering of all proteins of known structure, according to their evolutionary and structural relationsh...
Loredana Lo Conte, Steven E. Brenner, Tim J. P. Hu...
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
Here we investigate an extension of a previously suggested "automatic amide I frequency selection procedure" where we introduce an additional criterion utilizing empiric...
Joachim A. Hering, Peter R. Innocent, Parvez I. Ha...