642 search results - page 36 / 129 » corr 2006 |
78
Voted
CORR
2006
Springer
15 years 14 days ago
2006
Springer
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that -precision graphs are planar for > 1/ 2 and give a dichotomy theorem f...
85
Voted
CORR
2006
Springer
15 years 14 days ago
2006
Springer
We consider a distributed source coding system in which several observations must be encoded separately and communicated to the decoder by using limited transmission rate. We intro...
111
click to vote
CORR
2006
Springer
15 years 14 days ago
2006
Springer
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...
CORR
2006
Springer
15 years 14 days ago
2006
Springer
An outer bound to the capacity region of the two-receiver discrete memoryless broadcast channel is given. The outer bound is tight for all cases where the capacity region is known....
78
Voted
CORR
2006
Springer
15 years 14 days ago
2006
Springer
In vector quantization the number of vectors used to construct the codebook is always an undefined problem, there is always a compromise between the number of vectors and the quan...