459 search results - page 4 / 92 » Computational Complexity of Probabilistic Disambiguation |
IROS
2009
IEEE
14 years 4 months ago
2009
IEEE
— In this paper, we investigate the problem of 3D object categorization of objects typically present in kitchen environments, from data acquired using a composite sensor. Our fra...
JC
2006
13 years 9 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
RSFDGRC
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks,...
DCC
1999
IEEE
14 years 2 months ago
1999
IEEE
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...
ACL
2011
13 years 1 months ago
2011
Resolving coordination ambiguity is a classic hard problem. This paper looks at coordination disambiguation in complex noun phrases (NPs). Parsers trained on the Penn Treebank are...