Sciweavers

50 search results - page 4 / 10
» Definable encodings in the computably enumerable sets
Sort
View
ENTCS
2010
96views more  ENTCS 2010»
13 years 6 months ago
Programming in Biomolecular Computation
Our goal is to provide a top-down approach to biomolecular computation. In spite of widespread discussion about connections between biology and computation, one question seems not...
Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen
BMCBI
2005
94views more  BMCBI 2005»
13 years 8 months ago
Computational identification of strain-, species- and genus-specific proteins
Background: The identification of unique proteins at different taxonomic levels has both scientific and practical value. Strain-, species- and genus-specific proteins can provide ...
Raja Mazumder, Darren A. Natale, Sudhir Murthy, Ra...
LREC
2008
138views Education» more  LREC 2008»
13 years 10 months ago
Pragmatic Annotation of Discourse Markers in a Multilingual Parallel Corpus (Arabic- Spanish-English)
Discourse structure and coherence relations are one of the main inferential challenges addressed by computational pragmatics. The present study focuses on discourse markers as key...
Doaa Samy, Ana González-Ledesma
WWW
2010
ACM
13 years 8 months ago
Exploiting content redundancy for web information extraction
We propose a novel extraction approach that exploits content redundancy on the web to extract structured data from template-based web sites. We start by populating a seed database...
Pankaj Gulhane, Rajeev Rastogi, Srinivasan H. Seng...
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 7 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel