2473 search results - page 167 / 495 » The Logic of Communication Graphs |
127
Voted
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
154
Voted
ICDCS
2002
IEEE
15 years 8 months ago
2002
IEEE
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
154
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—Thorup-Zwick (TZ) compact routing guarantees sublinear state growth with the size of the network by routing via landmarks and incurring some path stretch. It uses a pseudo-rando...
138
Voted
SIGMETRICS
2003
ACM
15 years 9 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
155
Voted
IWPSE
2003
IEEE
15 years 9 months ago
2003
IEEE
The dependencies and interrelations between classes and modules affect the maintainability of object-oriented systems. It is therefore important to capture weaknesses of the softw...