Sciweavers

175 search results - page 16 / 35
» Bounds for Permutation Rate-Distortion
Sort
View
ESANN
2004
13 years 9 months ago
Separability of analytic postnonlinear blind source separation with bounded sources
The aim of blind source separation (BSS) is to transform a mixed random vector such that the original sources are recovered. If the sources are assumed to be statistically independ...
Fabian J. Theis, Peter Gruber
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 7 months ago
New Bounds for the Capacity Region of the Finite-State Multiple Access Channel
The capacity region of the Finite-State Multiple Access Channel (FS-MAC) with feedback that may be an arbitrary time-invariant function of the channel output samples is considered....
Haim H. Permuter, Tsachy Weissman, Jun Chen
JCSS
2008
80views more  JCSS 2008»
13 years 7 months ago
Improved bounds on sorting by length-weighted reversals
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
Michael A. Bender, Dongdong Ge, Simai He, Haodong ...
SIAMJO
2010
110views more  SIAMJO 2010»
13 years 2 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
MFCS
2005
Springer
14 years 1 months ago
Approximating Reversal Distance for Strings with Bounded Number of Duplicates
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...
Petr Kolman