5451 search results - page 130 / 1091 » On very high degrees |
174
Voted
IEEECGIV
2009
IEEE
16 years 1 months ago
2009
IEEE
—There are several methods used for plotting curves in CAGD, e.g., by directly computing their basis functions (polynomials) or using their recursive algorithms. For the former m...
178
click to vote
INFOCOM
2003
IEEE
16 years 7 days ago
2003
IEEE
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
191
click to vote
MASCOTS
2003
15 years 8 months ago
2003
Recent work has shown that the physical connectivity of the Internet exhibits small-world behavior. Characterizing such behavior is important not only for generating realistic Int...
155
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
192
Voted
TON
2010
15 years 5 months ago
2010
Abstract—In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tr...