Sciweavers

5608 search results - page 184 / 1122
» On the Theory of Matchgate Computations
Sort
View
ACL
1997
15 years 3 months ago
A Theory of Parallelism and the Case of VP Ellipsis
We provide a general account of parallelism in discourse, and apply it to the special case of resolving possible readings for instances of VP ellipsis. We show how several problem...
Jerry R. Hobbs, Andrew Kehler
BMCBI
2007
154views more  BMCBI 2007»
15 years 1 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...
ECCC
2008
186views more  ECCC 2008»
15 years 1 months ago
Universal Semantic Communication II: A Theory of Goal-Oriented Communication
We continue the investigation of the task of meaningful communication among intelligent entities (players, agents) without any prior common language. Our generic thesis is that su...
Brendan Juba, Madhu Sudan
UPP
2004
Springer
15 years 7 months ago
Bio-inspired Computing Paradigms (Natural Computing)
Abstract. This is just a glimpse to the fruitful and constant preoccupation of computer science to try to get inspired by biology, at various levels. Besides briefly discussing th...
Gheorghe Paun
TCS
2002
15 years 1 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo