806 search results - page 15 / 162 » Lower Bounds on Correction Networks |
TIT
2010
13 years 2 months ago
2010
We study error-correcting codes for permutations under the infinity norm, motivated the rank-modulation scheme for flash memories. In this scheme, a set of n flash cells are combin...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper extends previously proposed bound propagation algorithm [11] for computing lower and upper bounds on posterior marginals in Bayesian networks. We improve the b...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—Inference of the routing topology and link performance from a node to a set of other nodes is an important component of network monitoring and application design. In thi...
ISCC
2005
IEEE
14 years 1 months ago
2005
IEEE
The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved Quality of Service (QoS) model...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Considering a two-way amplify-and-forward (AF) relay network and aiming to simultaneously maximize the two users’ mutual information lower bounds in the presence of channel esti...