Sciweavers

3573 search results - page 694 / 715
» Reasoning about Codata
Sort
View
JOC
2002
99views more  JOC 2002»
13 years 9 months ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
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 ...
Phong Q. Nguyen, Igor Shparlinski
NGC
1998
Springer
115views Communications» more  NGC 1998»
13 years 9 months ago
On Semantic Resolution with Lemmaizing and Contraction and a Formal Treatment of Caching
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...
Maria Paola Bonacina, Jieh Hsiang
TC
1998
13 years 9 months ago
A Primary-Backup Channel Approach to Dependable Real-Time Communication in Multihop Networks
—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...
Seungjae Han, Kang G. Shin
SIAMJO
2002
77views more  SIAMJO 2002»
13 years 9 months ago
Modifying SQP for Degenerate Problems
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the activ...
Stephen J. Wright
TITB
2002
142views more  TITB 2002»
13 years 9 months ago
Building a bioinformatics ontology using OIL
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...