1200 search results - page 5 / 240 » Marked Ancestor Problems |
STACS
1999
Springer
14 years 2 months ago
1999
Springer
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 ...
ENTCS
2008
13 years 10 months ago
2008
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
TSD
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. This paper deals with the problem of speech waveform polarity. As the polarity of speech waveform can influence the performance of pitch marking algorithms (see Sec. 4),...
WWW
2008
ACM
14 years 10 months ago
2008
ACM
In this paper, we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness. We take the disjunctive semantics among input key...
RECOMB
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. Whole genome doubling (WGD), a frequent occurrence during the evolution of the angiopsperms, complicates ancestral gene order reconstruction due to the multiplicity of so...