338 search results - page 5 / 68 » On the Complexity of Termination Inference for Processes |
106
click to vote
JCB
2007
14 years 9 months ago
2007
The problem of inferring haplotypes from genotypes of single nucleotide polymorphisms (SNPs) is essential for the understanding of genetic variation within and among populations, ...
SIPS
2006
IEEE
15 years 3 months ago
2006
IEEE
Although many stopping methods of iterative decoding have been discussed in the literatures extensively, many of them only focus on the solvable decoding. In this paper, we propos...
ANLP
1992
14 years 10 months ago
1992
It is often assumed that when natural language processing meets the real world, the ideal of aiming for complete and correct interpretations has to be abandoned. However, our expe...
131
click to vote
TABLEAUX
2009
Springer
15 years 4 months ago
2009
Springer
This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau i...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Event-driven automation of reactive functionalities for complex event processing is an urgent need in today's distributed service-oriented architectures and Web-based event-d...