736 search results - page 108 / 148 » Approximating the Number of Network Motifs |
181
click to vote
SAINT
2005
IEEE
16 years 9 days ago
2005
IEEE
In this paper, we propose an analytic approach of modeling a closed-loop network with multiple feedback loops using fluid-flow approximation. Specifically, we model building bl...
191
click to vote
SPAA
2004
ACM
16 years 5 days ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
183
Voted
CSCW
2008
ACM
15 years 8 months ago
2008
ACM
Social networks are popular for online communities. This paper evaluates the risk of sophisticated context-aware spam that could result from information sharing on social networks...
171
click to vote
SIROCCO
2010
15 years 8 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
195
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Quantitative characterization of the topological characteristics of protein-protein interaction (PPI) networks can enable the elucidation of biological functional modu...