✦ LIBER ✦

Set reconciliation with nearly optimal communication complexity

✍ Scribed by Minsky, Y.; Trachtenberg, A.; Zippel, R.

Book ID: 114637293
Publisher: IEEE
Year: 2003
Tongue: English
Weight: 295 KB
Volume: 49
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2003.815784

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Superefficiency in Vector Optimization w

Superefficiency in Vector Optimization with Nearly Subconvexlike Set-Valued Maps

✍ L. Y. Xia; J. H. Qiu 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 319 KB

Super efficiency in vector optimization

Super efficiency in vector optimization with nearly convexlike set-valued maps

✍ Aparna Mehra 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 131 KB

Henig Efficiency in Vector Optimization

Henig Efficiency in Vector Optimization with Nearly Cone-subconvexlike Set-valued Functions

✍ Qiu-sheng Qiu 📂 Article 📅 2007 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 162 KB

Benson proper efficiency in the nearly c

Benson proper efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions

✍ Yihong Xu; Sanyang Liu 📂 Article 📅 2003 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 311 KB

Still another rank determination of set

Still another rank determination of set intersection matrices with an application in communication complexity

✍ U. Tamm 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 415 KB

The set-intersection function gives the cardinality of the intersection of two sets. In order to obtain a lower bound for the communication complexity of this function, the rank of the corresponding characteristic function-value matrices was calculated in [l] and [Z]. In this note, the rank of these

On optimal signal sets for digital commu

On optimal signal sets for digital communications with finite precision and amplitude constraints

✍ Honig, M.L.; Boyd, S.P.; Gopinath, B.; Rantapaa, E. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 749 KB