Sciweavers

12697 search results - page 2433 / 2540
» Call for Papers
Sort
View
COLING
1996
13 years 10 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
ISMB
1994
13 years 10 months ago
An Improved System for Exon Recognition and Gene Modeling in Human DNA Sequence
A new version of the GRAIL system (Uberbacher and Mural, 1991; Mural et al., 1992; Uberbacher et al., 1993), called GRAILII, has recently been developed (Xu et al., 1994). GRAILII...
Yin Xu, J. Ralph Einstein, Richard J. Mural, Manes...
ISMB
1993
13 years 10 months ago
Minimizing Complexity in Cellular Automata Models of Self-Replication
Understanding self-replication from an information processing perspective is important because, amongother things, it can shed light on molecular mechanismsof biological reproduct...
James A. Reggia, Hui-Hsien Chou, Steven L. Armentr...
PTS
1993
106views Hardware» more  PTS 1993»
13 years 10 months ago
Generating Synchronizable Test Sequences Based on Finite State Machine with Distributed Ports
In the area of testing communication systems, the interfaces between systems to be tested and their testers have great impact on test generation and fault detectability. Several t...
Gang Luo, Rachida Dssouli, Gregor von Bochmann, Pa...
OSDI
1996
ACM
13 years 10 months ago
Safe Kernel Extensions Without Run-Time Checking
This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel r...
George C. Necula, Peter Lee
« Prev « First page 2433 / 2540 Last » Next »