17760 search results - page 382 / 3552 » A Generalization of the Massey-Ding Algorithm |
177
Voted
IWOCA
2009
Springer
16 years 2 months ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
214
click to vote
TAMC
2009
Springer
16 years 2 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
183
Voted
ICASSP
2008
IEEE
16 years 2 months ago
2008
IEEE
In this paper, we propose a new scheduling algorithm for the overlapped message passing decoding, which can be applied to general low-density parity check (LDPC) codes. The partia...
188
click to vote
ICC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—Although predicting the RFID tag distribution before a read cycle begins would be generally difficult and even futile, a likely and interesting scenario is where the ta...
239
click to vote
ICDCS
2008
IEEE
16 years 1 months ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...