Sciweavers

94 search results - page 11 / 19
» Connections in Networks: Hardness of Feasibility Versus Opti...
Sort
View
CIKM
2010
Springer
13 years 7 months ago
SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...
Jianbin Huang, Heli Sun, Jiawei Han, Hongbo Deng, ...
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
14 years 8 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
IJWMC
2010
115views more  IJWMC 2010»
13 years 5 months ago
Small-world effects in wireless agent sensor networks
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
Kenneth A. Hawick, Heath A. James
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
13 years 9 months ago
Towards memoryless model building
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
David Iclanzan, Dumitru Dumitrescu
INFOCOM
2012
IEEE
11 years 11 months ago
Towards energy-fairness in asynchronous duty-cycling sensor networks
Abstract—In this paper, we investigate the problem of controlling node sleep intervals so as to achieve the min-max energy fairness in asynchronous duty-cycling sensor networks. ...
Zhenjiang Li, Mo Li, Yunhao Liu