๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Divide-and-Conquer: Approaching the Capacity of the Two-Pair Bidirectional Gaussian Relay Network

โœ Scribed by Sezgin, A.; Avestimehr, A.S.; Khajehnejad, M.A.; Hassibi, B.


Book ID
114643024
Publisher
IEEE
Year
2012
Tongue
English
Weight
736 KB
Volume
58
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Improving the divide-and-conquer approac
โœ J. Stoye; S.W. Perrey; A.W.M. Dress ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 419 KB

We consider the problem of multiple sequence alignment: given k sequences of length at most n and a certain scoring function, find an alignment that minimizes the corresponding "sum of pairs" distance score. We generalize the divide-and-conquer technique described in [1,2], and present new ideas on