We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
—Many applications require communication services with guaranteed timeliness and fault tolerance at an acceptable level of overhead. We present a scheme for restoring real-time c...
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the activ...
This paper describes the initial stages of building an ontology of bioinformatics and molecular biology. The conceptualisation is encoded using the Ontology Inference Layer (OIL),...
Robert Stevens, Carole A. Goble, Ian Horrocks, Sea...