6274 search results - page 21 / 1255 » From query complexity to computational complexity |
COLING
1996
13 years 11 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...
CIE
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
ICPR
2010
IEEE
14 years 3 months ago
2010
IEEE
—Captions in videos play a significant role for automatically understanding and indexing video content, since much semantic information is associated with them. This paper presen...
ICDM
2005
IEEE
14 years 3 months ago
2005
IEEE
It is estimated that ninety percent of the world’s species have yet to be discovered and described. The main reason for the slow pace of new species description is that the scie...
COCOON
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...