Sciweavers

3247 search results - page 481 / 650
» Randomized smoothing networks
Sort
View
ICNP
2002
IEEE
15 years 11 months ago
Using Adaptive Rate Estimation to Provide Enhanced and Robust Transport over Heterogeneous Networks
The rapid advancement in wireless communication technology has spurred significant interest in the design and development of enhanced TCP protocols. Among them, TCP Westwood (TCPW...
Ren Wang, Massimo Valla, M. Y. Sanadidi, Mario Ger...
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 7 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
AAAI
2006
15 years 7 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...
SPRINGSIM
2007
15 years 7 months ago
Modeling and analysis of worm defense using stochastic activity networks
— Stochastic activity networks (SANs) are a widely used formalism for describing complex systems that have random behavior. Sophisticated software tools exist for the modeling an...
David M. Nicol, Steve Hanna, Frank Stratton, Willi...
CN
2010
183views more  CN 2010»
15 years 6 months ago
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
Mehdi Esnaashari, Mohammad Reza Meybodi