Sciweavers

5372 search results - page 393 / 1075
» complexity 2007
Sort
View
ICC
2007
IEEE
175views Communications» more  ICC 2007»
16 years 1 months ago
An Adaptive MIMO System Based on Unified Belief Propagation Detection
—An adaptive multiple input and multiple output with the code matrix index feedback [8]. One detector will (MIMO) system based on the unified belief propagation (BP) work in the ...
Xiumei Yang, Yong Xiong, Fan Wang
IPL
2006
141views more  IPL 2006»
15 years 6 months ago
Perfectly Reliable Message Transmission
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
Arvind Narayanan, K. Srinathan, C. Pandu Rangan
CORR
2007
Springer
60views Education» more  CORR 2007»
15 years 6 months ago
On Minimal Tree Realizations of Linear Codes
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
Navin Kashyap
CN
2007
123views more  CN 2007»
15 years 6 months ago
Generalized multicast congestion control
Efficient multicast congestion control (MCC) is one of the critical components required to enable the IP multicast deployment over the Internet. Previously proposed MCC schemes ca...
Jiang Li, Murat Yuksel, Xingzhe Fan, Shivkumar Kal...
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
16 years 28 days ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma