Sciweavers

225 search results - page 24 / 45
» Stably Computable Properties of Network Graphs
Sort
View
102
Voted
INFOCOM
2007
IEEE
15 years 7 months ago
Towards Topology Aware Networks
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...
Christos Gkantsidis, Gagan Goel, Milena Mihail, Am...
DIS
2009
Springer
15 years 4 months ago
Discovering Influential Nodes for SIS Models in Social Networks
We address the problem of efficiently discovering the influential nodes in a social network under the susceptible/infected/susceptible (SIS) model, a diffusion model where nodes ar...
Kazumi Saito, Masahiro Kimura, Hiroshi Motoda
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
14 years 10 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
ICNP
2000
IEEE
15 years 5 months ago
Convergent Multi-Path Routing
We present a protocol for maintaining multiple paths to each destination in a network of processes. For each destination, each process in the network maintains a set of neighbors ...
Jorge Arturo Cobb
INFOCOM
2012
IEEE
13 years 3 months ago
CONSEL: Connectivity-based segmentation in large-scale 2D/3D sensor networks
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...
Hongbo Jiang, Tianlong Yu, Chen Tian, Guang Tan, C...