2150 search results - page 68 / 430 » On a restricted cross-intersection problem |
126
click to vote
COLING
1996
15 years 5 months ago
1996
In this paper we sketch a decidable inference-based procedure for lexical disambiguation which operates on semantic representations of discourse and conceptual knowledge, In contr...
105
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...
103
click to vote
CSB
2005
IEEE
15 years 10 months ago
2005
IEEE
We study the parsimony approach to haplotype inference, which calls for finding a set of haplotypes of minimum cardinality that explains an input set of genotypes. We prove that ...
140
click to vote
JCS
2008
15 years 4 months ago
2008
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
129
click to vote
MFCS
2005
Springer
15 years 10 months ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...