Sciweavers

522 search results - page 27 / 105
» A Graph Theoretical Approach to Network Encoding Complexity
Sort
View
BMCBI
2005
156views more  BMCBI 2005»
15 years 2 months ago
A new dynamical layout algorithm for complex biochemical reaction networks
Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computatio...
Katja Wegner, Ursula Kummer
IM
2008
15 years 2 months ago
Directed Random Dot Product Graphs
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
Stephen J. Young, Edward R. Scheinerman
COMPSAC
2008
IEEE
15 years 9 months ago
Measuring Network Security Using Bayesian Network-Based Attack Graphs
Given the increasing dependence of our societies on information systems, the overall security of these systems should be measured and improved. Existing work generally focuses on ...
Marcel Frigault, Lingyu Wang
121
Voted
SDM
2008
SIAM
164views Data Mining» more  SDM 2008»
15 years 4 months ago
Randomizing Social Networks: a Spectrum Preserving Approach
Understanding the general properties of real social networks has gained much attention due to the proliferation of networked data. The nodes in the network are the individuals and...
Xiaowei Ying, Xintao Wu
SOFSEM
2007
Springer
15 years 9 months ago
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
Markus Maier, Steffen Mecke, Dorothea Wagner