814 search results - page 76 / 163 » Optimal pairings |
IPL
2007
13 years 10 months ago
2007
For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...
WIOPT
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract—Development of dynamic spectrum access and allocation techniques recently have made feasible the vision of cognitive radio systems. However, a fundamental question arise...
GLOBECOM
2010
IEEE
13 years 8 months ago
2010
IEEE
In cognitive networks, since nodes generally belong to different authorities and pursue different goals, they will not cooperate with others unless cooperation can improve their ow...
CAD
2011
Springer
13 years 5 months ago
2011
Springer
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
We propose a low complexity analog joint source channel coding Multiple Description (MD) scheme for transmitting the symbols of a Gaussian source across a pair of independent AWGN...