Sciweavers

159 search results - page 21 / 32
» Randomized Rumor Spreading
Sort
View
ICDCS
2010
IEEE
14 years 1 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
AAAI
2006
13 years 11 months ago
When Gossip is Good: Distributed Probabilistic Inference for Detection of Slow Network Intrusions
Intrusion attempts due to self-propagating code are becoming an increasingly urgent problem, in part due to the homogeneous makeup of the internet. Recent advances in anomalybased...
Denver Dash, Branislav Kveton, John Mark Agosta, E...
CIC
2006
101views Communications» more  CIC 2006»
13 years 11 months ago
Non Blocking OVSF Codes Influence The Performance Of WCDMA System
In this paper the performance of OVSF and NOVSF codes in WCDMA are evaluated by calculating their blocking probability and plotting graphs between blocking probability and new call...
Shailendra Mishra, Nipur
TIT
2002
101views more  TIT 2002»
13 years 9 months ago
Large-system performance analysis of blind and group-blind multiuser receivers
We present a large-system performance analysis of blind and group-blind multiuser detection methods. In these methods, the receivers are estimated based on the received signal samp...
Junshan Zhang, Xiaodong Wang
ICML
2009
IEEE
14 years 10 months ago
Monte-Carlo simulation balancing
In this paper we introduce the first algorithms for efficiently learning a simulation policy for Monte-Carlo search. Our main idea is to optimise the balance of a simulation polic...
David Silver, Gerald Tesauro