Sciweavers

111 search results - page 19 / 23
» Minimum-cost network hardening using attack graphs
Sort
View
CCS
2009
ACM
14 years 7 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
WOWMOM
2006
ACM
168views Multimedia» more  WOWMOM 2006»
14 years 29 days ago
Modeling Node Compromise Spread in Wireless Sensor Networks Using Epidemic Theory
Motivated by recent surfacing viruses that can spread over the air interfaces, in this paper, we investigate the potential disastrous threat of node compromise spreading in wirele...
Pradip De, Yonghe Liu, Sajal K. Das
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
11 years 9 months ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...
WSDM
2010
ACM
254views Data Mining» more  WSDM 2010»
14 years 4 months ago
Learning Influence Probabilities In Social Networks
Recently, there has been tremendous interest in the phenomenon of influence propagation in social networks. The studies in this area assume they have as input to their problems a ...
Amit Goyal 0002, Francesco Bonchi, Laks V. S. Laks...
WWW
2004
ACM
14 years 7 months ago
Towards the composition of Ad Hoc B2B Applications: Semantics, Properties and Complexity Management
The goal is to build a general framework for ad hoc applications over large networks using semantics and complex systems analysis. The first part deals with semantics because appl...
Jaime Delgado, Rosa Gil, Zièd Choukair