1532 search results - page 41 / 307 » The Symbol Grounding Problem |
127
click to vote
PDPTA
2000
15 years 5 months ago
2000
In this paper we address the issue of dependable distributed high performance computing in the field of Symbolic Computation. We describe the extension of a middleware infrastructu...
133
click to vote
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
143
Voted
ENTCS
2008
15 years 3 months ago
2008
Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ...
121
click to vote
ECIS
2001
15 years 5 months ago
2001
The authors describe on going research to uncover the architectonic nature of artefacts and see how these may be related to high-level, but also grounded, model of the original pr...
149
click to vote
TASLP
2008
15 years 3 months ago
2008
We describe an acoustic chord transcription system that uses symbolic data to train hidden Markov models and gives best-of-class frame-level recognition results. We avoid the extre...