1532 search results - page 186 / 307 » The Symbol Grounding Problem |
109
click to vote
DM
1998
15 years 4 months ago
1998
One class of Davenport-Schinzel sequences consists of finite sequences over n symbols without immediate repetitions and without any subsequence of the type abab. We present a bij...
144
click to vote
PR
1998
15 years 4 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
152
click to vote
ICIP
2010
IEEE
15 years 2 months ago
2010
IEEE
We deal with the problem of distributed source coding with decoder side information, when the decoder observes the source through a noisy channel. Existing approaches employ syndr...
243
click to vote
LPAR
2010
Springer
15 years 2 months ago
2010
Springer
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...
140
click to vote
TCOM
2010
14 years 11 months ago
2010
Abstract--Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in the presence of noisy channels. Addressing this problem with joint sour...