Sciweavers

792 search results - page 20 / 159
» Reading What Machines
Sort
View
BMCBI
2004
140views more  BMCBI 2004»
13 years 7 months ago
What can we learn from noncoding regions of similarity between genomes?
Background: In addition to known protein-coding genes, large amounts of apparently non-coding sequence are conserved between the human and mouse genomes. It seems reasonable to as...
Thomas A. Down, Tim J. P. Hubbard
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 months ago
On Termination for Faulty Channel Machines
A channel machine consists of a finite controller together with several fifo channels; the controller can read messages from the head of a channel and write messages to the tail of...
Patricia Bouyer, Nicolas Markey, Joël Ouaknin...
AI
1998
Springer
13 years 7 months ago
What Robots Can Do: Robot Programs and Effective Achievability
In this paper, we propose a deļ¬nition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot...
Fangzhen Lin, Hector J. Levesque
ACL
2009
13 years 5 months ago
Who, What, When, Where, Why? Comparing Multiple Approaches to the Cross-Lingual 5W Task
Cross-lingual tasks are especially difficult due to the compounding effect of errors in language processing and errors in machine translation (MT). In this paper, we present an er...
Kristen Parton, Kathleen McKeown, Bob Coyne, Mona ...
ENTCS
2011
131views more  ENTCS 2011»
13 years 2 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ā€˜Computational Complexity in Non-Turing Models of Computationā...
Ed Blakey