Sciweavers

157 search results - page 3 / 32
» Tackling Post's Correspondence Problem
Sort
View
BMCBI
2005
125views more  BMCBI 2005»
13 years 7 months ago
A simple approach for protein name identification: prospects and limits
Background: Significant parts of biological knowledge are available only as unstructured text in articles of biomedical journals. By automatically identifying gene and gene produc...
Katrin Fundel, Daniel Güttler, Ralf Zimmer, J...
WSDM
2012
ACM
300views Data Mining» more  WSDM 2012»
12 years 2 months ago
Adding semantics to microblog posts
Microblogs have become an important source of information for the purpose of marketing, intelligence, and reputation management. Streams of microblogs are of great value because o...
Edgar Meij, Wouter Weerkamp, Maarten de Rijke
LITP
1990
13 years 11 months ago
Infinite Traces
In this paper we provide several new results concerning word and matrix semigroup problems using counter automaton models. As a main result, we prove a new version of Post's c...
Paul Gastin
CORR
2008
Springer
109views Education» more  CORR 2008»
13 years 7 months ago
New Combinatorial Complete One-Way Functions
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we presen...
Arist Kojevnikov, Sergey I. Nikolenko
STACS
1999
Springer
13 years 11 months ago
Decidability and Undecidability of Marked PCP
We show that the marked version of the Post Correspondence Problem, where the words on a list are required to di er in the rst letter, is decidable. On the other hand, PCP remains ...
Vesa Halava, Mika Hirvensalo, Ronald de Wolf