Sciweavers

110 search results - page 12 / 22
» Building Evidence Graphs for Network Forensics Analysis
Sort
View
119
Voted
INFOCOM
2012
IEEE
13 years 2 months ago
On superposition of heterogeneous edge processes in dynamic random graphs
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...
Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov
122
Voted
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
13 years 2 months ago
Chromatic correlation clustering
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...
119
Voted
ICDE
2007
IEEE
169views Database» more  ICDE 2007»
15 years 3 months ago
Semantic Web Services Composition: A Network Analysis Approach
"Software as a service" approach has become a reality since efforts of both industry and research focused on service integration on the web. It would be possible to see ...
Gokay Burak Akkus
CGF
2010
121views more  CGF 2010»
14 years 11 months ago
GraphDice: A System for Exploring Multivariate Social Networks
Social networks collected by historians or sociologists typically have a large number of actors and edge attributes. Applying social network analysis (SNA) algorithms to these net...
Anastasia Bezerianos, Fanny Chevalier, Pierre Drag...
115
Voted
LATIN
2010
Springer
15 years 6 months ago
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
Dominik Gall, Riko Jacob, Andréa W. Richa, ...