Sciweavers

1282 search results - page 93 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
103
Voted
IJCNN
2006
IEEE
15 years 8 months ago
Particle Swarm Optimization based Defensive Islanding of Large Scale Power System
— Defensive islanding is an efficient way to avoid catastrophic failures and wide area blackouts. Power system splitting especially for large scale power systems is a combinatori...
Wenxin Liu, David A. Cartes, Ganesh K. Venayagamoo...
118
Voted
DASFAA
2009
IEEE
173views Database» more  DASFAA 2009»
15 years 6 months ago
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu ...
126
Voted
WWW
2010
ACM
15 years 9 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney
WETICE
1998
IEEE
15 years 6 months ago
Efficient Security for Large and Dynamic Multicast Groups
Proposals for multicast security that have been published so far are complex, often require trust in network components or are inefficient. In this paper we propose a series of no...
Germano Caronni, Marcel Waldvogel, Dan Sun, Bernha...
EDBT
2012
ACM
228views Database» more  EDBT 2012»
13 years 4 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...