1532 search results - page 301 / 307 » The Symbol Grounding Problem |
ALT
1995
Springer
15 years 1 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
102
Voted
ICCV
1995
IEEE
15 years 1 months ago
1995
IEEE
A new approach to tracking weakly modeled objects in a semantically rich domain is presented. We define a closed-world as a space-time region of an image sequence in which the co...
FC
2010
Springer
15 years 23 days ago
2010
Springer
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
100
Voted
CSCLP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
95
Voted
DAGSTUHL
2006
14 years 10 months ago
2006
Abstract. "Cognitive computer vision is concerned with integration and control of vision systems using explicit but not necessarily symbolic models of context, situation and g...