67 search results - page 14 / 14 » Complexity Results on Graphs with Few Cliques |
ICC
2008
IEEE
14 years 1 months ago
2008
IEEE
— Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to sto...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— The topological structure of the Internet infrastructure is an important and interesting subject that attracted significant research attention in the last few years. A...