61 search results - page 10 / 13 » Recognition by Probabilistic Hypothesis Construction |
ECCC
2007
13 years 7 months ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
COLING
2010
13 years 2 months ago
2010
Emotion words have been well used as the most obvious choice as feature in the task of textual emotion recognition and automatic emotion lexicon construction. In this work, we exp...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
The problem considered in this paper is the fully automatic construction of panoramas. Fundamentally, this problem requires recognition, as we need to know which parts of the pano...
NIPS
1998
13 years 9 months ago
1998
We compare the ability of three exemplar-based memory models, each using three different face stimulus representations, to account for the probability a human subject responded &q...
IJCAI
2003
13 years 9 months ago
2003
Dynamic Bayesian networks (DBNs) offer an elegant way to integrate various aspects of language in one model. Many existing algorithms developed for learning and inference in DBNs ...