459 search results - page 27 / 92 » Computational Complexity of Probabilistic Disambiguation |
COLING
2002
14 years 11 months ago
2002
Title generation is a complex task involving both natural language understanding and natural language synthesis. In this paper, we propose a new probabilistic model for title gene...
116
click to vote
PODS
2008
ACM
15 years 12 months ago
2008
ACM
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
107
click to vote
COCO
2000
Springer
15 years 4 months ago
2000
Springer
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
FMCO
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Coordination languages are intended to simplify the development of complex software systems by separating the coordination aspects of an application from its computation ...