Sciweavers

6102 search results - page 701 / 1221
» Generating Optimizing Specializers
Sort
View
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 7 months ago
Capacity of a Class of Deterministic Relay Channels
Abstract-- The capacity of a class of deterministic relay channels with the transmitter input X, the receiver output Y , the relay output Y1 = f(X, Y ), and a separate communicatio...
Thomas M. Cover, Young-Han Kim
DAM
2006
132views more  DAM 2006»
15 years 7 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 7 months ago
Searching for low weight pseudo-codewords
— Belief Propagation (BP) and Linear Programming (LP) decodings of Low Density Parity Check (LDPC) codes are discussed. We summarize results of instanton/pseudo-codeword approach...
Michael Chertkov, Mikhail G. Stepanov
CORR
2007
Springer
109views Education» more  CORR 2007»
15 years 7 months ago
On the Outage Capacity of a Practical Decoder Accounting for Channel Estimation Inaccuracies
—The optimal decoder achieving the outage capacity under imperfect channel estimation is investigated. First, by searching into the family of nearest neighbor decoders, which can...
Pablo Piantanida, Sajad Sadough, Pierre Duhamel
CORR
2007
Springer
47views Education» more  CORR 2007»
15 years 7 months ago
Data Structures for Mergeable Trees
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robe...