35 search results - page 1 / 7 » Propagation Connectivity of Random Hypergraphs |
SAGA
2009
Springer
13 years 9 months ago
2009
Springer
COCOON
2006
Springer
13 years 6 months ago
2006
Springer
Denote by an -component a connected b-uniform hypergraph with k edges and k(b - 1) - vertices. We prove that the expected number of creations of -component during a random hypergr...
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
—In this paper the problem of evaluating the statistics of the connected nodes position in a multi-hop wireless random ad hoc network is addressed. In particular, an analytical m...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
In patch based face super-resolution method, the patch size is usually very small, and neighbor patches’ relationship via overlapped regions is only to keep smoothness of recons...