Sciweavers

7544 search results - page 322 / 1509
» Network Forensics Analysis
Sort
View
UAI
2004
15 years 8 months ago
Evidence-invariant Sensitivity Bounds
The sensitivities revealed by a sensitivity analysis of a probabilistic network typically depend on the entered evidence. For a real-life network therefore, the analysis is perfor...
Silja Renooij, Linda C. van der Gaag
206
Voted
ADHOCNOW
2006
Springer
16 years 1 months ago
Initialization for Ad Hoc Radio Networks with Carrier Sensing and Collision Detection
We consider an ad-hoc network consisting of devices that try to gain access for transmission through a shared communication channel. We redesign randomized protocol of Cai, Lu and ...
Jacek Cichon, Miroslaw Kutylowski, Marcin Zawada
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
15 years 9 months ago
Ranking of Closeness Centrality for Large-Scale Social Networks
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
Kazuya Okamoto, Wei Chen, Xiang-Yang Li
PARMA
2004
174views Database» more  PARMA 2004»
15 years 8 months ago
Finding Spatial Patterns in Network Data
Data on modern networks are massive and are applied in the area of monitoring and analyzing activities at the network element, network-wide, and customer and service levels for a h...
Roland Heilmann, Daniel A. Keim, Christian Panse, ...
WICON
2008
15 years 8 months ago
What is optimal scheduling in wireless networks?
We consider a wireless network consisting of multiple transmitters with multicast traffic destined for a set of receivers. We are interested in the problem of joint scheduling and...
Anna Pantelidou, Anthony Ephremides