170 search results - page 6 / 34 » Information processing in complex networks: Graph entropy an... |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
Data discretization is defined as a process of converting continuous data attribute values into a finite set of intervals with minimal loss of information. In this paper, we prove...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
Social media forms a central domain for the production and dissemination of real-time information. Even though such flows of information have traditionally been thought of as diffu...
BMCBI
2007
13 years 7 months ago
2007
Background: Nowadays modern biology aims at unravelling the strands of complex biological structures such as the protein-protein interaction (PPI) networks. A key concept in the o...
BMCBI
2004
13 years 7 months ago
2004
Background: Several in silico methods exist that were developed to predict protein interactions from the copious amount of genomic and proteomic data. One of these methods is Doma...