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...
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...
—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...
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...
Kai Guo, Xiaokang Yang, Rui Zhang, Guangtao Zhai, ...