Sciweavers

1512 search results - page 181 / 303
» connection 2006
Sort
View
IGPL
1998
97views more  IGPL 1998»
15 years 5 months ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
JCB
2002
131views more  JCB 2002»
15 years 5 months ago
Modeling and Simulation of Genetic Regulatory Systems: A Literature Review
In order to understand the functioning of organisms on the molecular level, we need to know which genes are expressed, when and where in the organism, and to which extent. The reg...
Hidde de Jong
JIIS
2002
99views more  JIIS 2002»
15 years 5 months ago
Efficient Management of Persistent Knowledge
Although computer speed has steadily increased and memory is getting cheaper, the need for storage managers to deal efficiently with applications that cannot be held into main memo...
Dimitris G. Kapopoulos, Michael Hatzopoulos, Panag...
JMLR
2002
133views more  JMLR 2002»
15 years 5 months ago
Learning Precise Timing with LSTM Recurrent Networks
The temporal distance between events conveys information essential for numerous sequential tasks such as motor control and rhythm detection. While Hidden Markov Models tend to ign...
Felix A. Gers, Nicol N. Schraudolph, Jürgen S...
JOC
2002
99views more  JOC 2002»
15 years 5 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