124 search results - page 5 / 25 » The spread of the unicyclic graphs |
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper we propose two methods to derive two different kinds of node similarities in a network based on their neighborhood. The first similarity measure focuses on the overla...
TWC
2008
13 years 6 months ago
2008
In this letter, we propose a generalized version of the window-based pseudonoise (PN) acquisition scheme verifying one or more best hypotheses rather than the best one per search w...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particula...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data ...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper, a low-complexity high-performance detection algorithm for multiple input multiple output (MIMO) channels with severe delay spread is proposed. This algorithm per...