Sciweavers

159 search results - page 24 / 32
» Codes identifying sets of vertices in random networks
Sort
View
ANSS
2005
IEEE
14 years 1 months ago
Mobility Modeling of Outdoor Scenarios for MANETs
Mobility of users significantly impacts performance of a mobile ad-hoc network. Most existing simulation tools offer only a few random mobility models, which poorly reflect user m...
Illya Stepanov, Pedro José Marrón, K...
AAAI
2006
13 years 9 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...
INFOCOM
2007
IEEE
14 years 1 months ago
Reliable Broadcast in Wireless Networks with Probabilistic Failures
We consider the problem of reliable broadcast in a wireless network in which nodes are prone to failure. In the failure mode considered in this paper, each node can fail independe...
Vartika Bhandari, Nitin H. Vaidya
WWW
2007
ACM
14 years 8 months ago
Long distance wireless mesh network planning: problem formulation and solution
Several research efforts as well as deployments have chosen IEEE 802.11 as a low-cost, long-distance access technology to bridge the digital divide. In this paper, we consider the...
Sayandeep Sen, Bhaskaran Raman
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 7 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...