46 search results - page 9 / 10 » Lower connectivities of regular graphs with small diameter |
231
click to vote
PVLDB
2011
14 years 8 months ago
2011
With the recent surge of social networks such as Facebook, new forms of recommendations have become possible – recommendations that rely on one’s social connections in order t...
143
Voted
CPC
2010
14 years 11 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
GLOBECOM
2006
IEEE
15 years 7 months ago
2006
IEEE
— In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower...
112
click to vote
FOCS
2010
IEEE
14 years 11 months ago
2010
IEEE
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
119
click to vote
MOBIHOC
2008
ACM
16 years 1 months ago
2008
ACM
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...