Sciweavers

3534 search results - page 278 / 707
» On Structural Analysis of Large Networks
Sort
View
GFKL
2005
Springer
101views Data Mining» more  GFKL 2005»
16 years 1 days ago
Discovering Communities in Linked Data by Multi-view Clustering
Abstract. We consider the problem of finding communities in large linked networks such as web structures or citation networks. We review similarity measures for linked objects and...
Isabel Drost, Steffen Bickel, Tobias Scheffer
ICPP
2006
IEEE
16 years 17 days ago
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
David A. Bader, Kamesh Madduri
IANDC
2008
120views more  IANDC 2008»
15 years 6 months ago
A framework for compositional verification of security protocols
Automatic security protocol analysis is currently feasible only for small protocols. Since larger protocols quite often are composed of many small protocols, compositional analysi...
Suzana Andova, Cas J. F. Cremers, Kristian Gj&osla...
JSS
2006
85views more  JSS 2006»
15 years 6 months ago
Effects of context on program slicing
Whether context-sensitive program analysis is more effective than context-insensitive analysis is an ongoing discussion. There is evidence that context-sensitivity matters in comp...
Jens Krinke
EPIA
2009
Springer
16 years 1 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...