1532 search results - page 188 / 307 » The Symbol Grounding Problem |
133
click to vote
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
—The error floor of bit-interleaved coded modulation with iterative decoding (BICM-ID) can be minimized for a particular constellation by maximizing the harmonic mean of the squ...
107
click to vote
ICDM
2008
IEEE
15 years 11 months ago
2008
IEEE
The task of aligning sequences arises in many applications. Classical dynamic programming approaches require the explicit state enumeration in the reward model. This is often impr...
139
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
147
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...
139
click to vote
AB
2007
Springer
15 years 8 months ago
2007
Springer
Given a permutation , the application of prefix reversal f(i) to reverses the order of the first i elements of . The problem of Sorting By Prefix Reversals (also known as pancake ...