Sciweavers

814 search results - page 24 / 163
» Optimal pairings
Sort
View
CORR
2006
Springer
114views Education» more  CORR 2006»
13 years 10 months ago
Polynomial-time algorithms for coding across multiple unicasts
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network code...
Tracey Ho
LATIN
2004
Springer
14 years 3 months ago
Embracing the Giant Component
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
JSAC
2011
134views more  JSAC 2011»
13 years 4 months ago
Simple Channel Sensing Order in Cognitive Radio Networks
— In cognitive radio networks (CRNs), effective and efficient channel exploitation is imperative for unlicensed secondary users to seize available network resources and improve ...
Ho Ting Cheng, Weihua Zhuang
TIT
2002
125views more  TIT 2002»
13 years 9 months ago
Optimal bi-level quantization of i.i.d. sensor observations for binary hypothesis testing
We consider the problem of binary hypothesis testing using binary decisions from independent and identically distributed (i.i.d). sensors. Identical likelihood-ratio quantizers wit...
Qian Zhang, Pramod K. Varshney, Richard D. Wesel
TWC
2010
13 years 4 months ago
Power allocation for F/TDMA multiuser two-way relay networks
We consider a multiuser two-way relay network where multiple pairs of users exchange information with the assistance of a relay node, using orthogonal channels per pair. For a vari...
Min Chen, Aylin Yener