1532 search results - page 99 / 307 » The Symbol Grounding Problem |
136
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consi...
173
click to vote
ICDAR
2009
IEEE
15 years 2 months ago
2009
IEEE
Chemical expressions have more variant structures in 2-D space than that in math equations. In this paper we propose a unified framework for recognizing handwritten chemical expre...
149
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
127
click to vote
CAV
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
132
click to vote
DAS
2010
Springer
15 years 7 months ago
2010
Springer
We consider the problem of dealing with irrelevant votes when a multi-case classifier is built from an ensemble of binary classifiers. We show how run-off elections can be used to...