Sciweavers

867 search results - page 53 / 174
» Network Robustness and Graph Topology
Sort
View
EDBTW
2010
Springer
14 years 2 months ago
Biochemical network matching and composition
Graph composition has applications in a variety of practical applications. In drug development, for instance, in order to understand possible drug interactions, one has to merge k...
Martin Hugh Goodfellow, John Wilson, Ela Hunt
CSE
2009
IEEE
13 years 5 months ago
Edge Anonymity in Social Network Graphs
Edges in social network graphs can model sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge ano...
Lijie Zhang, Weining Zhang
ICDM
2008
IEEE
121views Data Mining» more  ICDM 2008»
14 years 2 months ago
Unifying Unknown Nodes in the Internet Graph Using Semisupervised Spectral Clustering
Most research on Internet topology is based on active measurement methods. A major difficulty in using these tools is that one comes across many unresponsive routers. Different m...
Anat Almog, Jacob Goldberger, Yuval Shavitt
MOBICOM
2005
ACM
14 years 1 months ago
MAP: medial axis based geometric routing in sensor networks
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
IPSN
2004
Springer
14 years 1 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...