401 search results - page 73 / 81 » Sparse Quasi-Random Graphs |
IEEECIT
2007
IEEE
14 years 2 months ago
2007
IEEE
In light of the history of LDPC codes and relevant research advances in recent years, this paper probes into the encoding and decoding techniques related to this capacity-approach...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
—Geographic routing protocols like GOAFR or GPSR rely on exact location information at the nodes, because when the greedy routing phase gets stuck at a local minimum, they requir...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper presents the optimization and evaluation of parallel I/O for the BIPS3D parallel irregular application, a 3-dimensional simulation of BJT and HBT bipolar devices. The p...
IWSOS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A fundamental problem of future networks is to get fully selforganized routing protocols with good scalability properties that produce good paths in a wide range of netwo...
DCOSS
2005
Springer
14 years 1 months ago
2005
Springer
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...