1963 search results - page 216 / 393 » The Maximum Solution Problem on Graphs |
DCC
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper interprets image interpolation as a channel decoding problem and proposes a tanner graph based interpolation framework, which regards each pixel in an image as a variab...
112
click to vote
CN
2008
15 years 28 days ago
2008
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...
101
Voted
CORR
2008
Springer
15 years 27 days ago
2008
Springer
We explore the problem of rate and power allocation for a sensor network where pairwise distributed source coding is employed (introduced by Roumy and Gesbert `07). For noiseless n...
98
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
161
Voted
CPE
1994
Springer
15 years 4 months ago
1994
Springer
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...