3204 search results - page 218 / 641 » The Alcuin Number of a Graph |
129
click to vote
GLOBECOM
2006
IEEE
16 years 5 days 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...
158
click to vote
SPAA
2005
ACM
15 years 11 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...
198
click to vote
PDCAT
2005
Springer
15 years 11 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 ...
191
click to vote
PAAPP
2000
15 years 5 months ago
2000
Minimizing the amount of time and number of processors needed to perform an application reduces the application's fabrication cost and operation costs. A directed acyclic gra...
182
Voted
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...