3204 search results - page 296 / 641 » The b-chromatic Number of a Graph |
77
Voted
GLOBECOM
2006
IEEE
15 years 7 months ago
2006
IEEE
— We analyze the effect of redundant parity-check equations on the error-floor performance of low-density paritycheck (LDPC) codes used over the additive white Gaussian noise (A...
106
Voted
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
145
Voted
PDCAT
2005
Springer
15 years 6 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
ICCAD
1996
IEEE
15 years 5 months ago
1996
IEEE
The functional validation of a state-of-the-art digital design is usually performed by simulation of a register-transfer-level model. The degree to which the testvector suite cove...
105
click to vote
SIGCOMM
1992
ACM
15 years 5 months ago
1992
ACM
With the emergence of large switched public data networks that are well-suited to connectionless internets, for instance SMDS, it is possible that larger and larger numbers of int...