420 search results - page 33 / 84 » Search on High Degree Graphs |
108
click to vote
JPDC
1998
15 years 11 days ago
1998
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. A key feature of this parallel formulation is that it is able to achieve a high ...
104
Voted
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
96
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
This paper proposes a method to optimize the performance of tandem source–channel coding with respect to the mean-squared error by exploiting the unequal error protection coding...
105
click to vote
CN
2006
15 years 23 days ago
2006
Recent work has shown that the physical connectivity of the Internet exhibits small-world behavior. Characterizing such behavior is important not only for generating realistic Int...
106
Voted
ISCC
2008
IEEE
15 years 7 months ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...