12 search results - page 2 / 3 » An Algorithm for Face-Constrained Encoding of Symbols Using ... |
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is th...
DCC
2006
IEEE
14 years 4 months ago
2006
IEEE
We investigate the optimum transmission strategy that minimizes the overall distortion for delaysensitive but distortion-tolerant data. We consider a set of source symbols residin...
JSAC
2010
13 years 2 days ago
2010
The prior art construction of sets of balanced codewords by Knuth is attractive for its simplicity and absence of look-up tables, but the redundancy of the balanced codes generated...
ITSL
2008
13 years 6 months ago
2008
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
GECCO
2009
Springer
13 years 10 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...