941 search results - page 7 / 189 » The Parking Permit Problem |
COLING
1996
14 years 10 months ago
1996
In this paper we address the problem of compound noun indexing that is about segmenting or decomposing compound nouns into promising index
99
Voted
ICIP
1998
IEEE
15 years 1 months ago
1998
IEEE
1 In this paper, the segmentation problem is formulated as a problem of segmenting a Riemannian manifold. The image domain is endowed with an anisotropic metric and its segmentatio...
70
Voted
CIE
2008
Springer
14 years 9 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
IPL
2006
14 years 9 months ago
2006
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
AUSAI
2006
Springer
15 years 1 months ago
2006
Springer
Real-world document classification is an open-ended problem, rather than a close-ended problem, because the document classification domain continually evolves as the time passes. U...