840 search results - page 32 / 168 » The Complexity of the Extended GCD Problem |
ACL
2009
13 years 5 months ago
2009
In this paper, we analyze the impact of different automatic annotation methods on the performance of supervised approaches to the complex question answering problem (defined in th...
SACMAT
2005
ACM
14 years 1 months ago
2005
ACM
As privacy becomes a major concern for both consumers and enterprises, many research efforts have been devoted to the development of privacy protecting technology. We recently pr...
ADHOCNOW
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. In focused coverage problem, sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has h...
FORMATS
2008
Springer
13 years 9 months ago
2008
Springer
The common metric temporal logics for continuous time were shown to be insufficient, when it was proved in [7, 12] that they cannot express a modality suggested by Pnueli. Moreover...
COLING
1996
13 years 9 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...