Sciweavers

862 search results - page 45 / 173
» Random Information Spread in Networks
Sort
View
AMAI
2008
Springer
15 years 2 months ago
Bayesian learning of Bayesian networks with informative priors
This paper presents and evaluates an approach to Bayesian model averaging where the models are Bayesian nets (BNs). Prior distributions are defined using stochastic logic programs...
Nicos Angelopoulos, James Cussens
WWW
2010
ACM
15 years 2 months ago
Randomization tests for distinguishing social influence and homophily effects
Relational autocorrelation is ubiquitous in relational domains. This observed correlation between class labels of linked instances in a network (e.g., two friends are more likely ...
Timothy La Fond, Jennifer Neville
147
Voted
MSE
2002
IEEE
198views Hardware» more  MSE 2002»
15 years 6 months ago
BSS: A New Approach for Watermark Attack
Digital watermarking is the enabling technology to prove ownership on copyrighted material, detect originators of illegally made copies, monitor the usage of the copyrighted multi...
Jiang Du, Choong-Hoon Lee, Heung-Kyu Lee, Young-Ho...
IJSN
2007
73views more  IJSN 2007»
15 years 1 months ago
Optimal worm-scanning method using vulnerable-host distributions
: Most Internet worms use random scanning. The distribution of vulnerable hosts on the Internet, however, is highly non-uniform over the IP-address space. This implies that random ...
Zesheng Chen, Chuanyi Ji
DSN
2009
IEEE
15 years 8 months ago
Verme: Worm containment in overlay networks
Topological worms, such as those that propagate by following links in an overlay network, have the potential to spread faster than traditional random scanning worms because they h...
Filipe Freitas, Edgar Marques, Rodrigo Rodrigues, ...