Sciweavers

176 search results - page 20 / 36
» Network Probabilistic Connectivity: Optimal Structures
Sort
View
ADHOC
2007
144views more  ADHOC 2007»
13 years 7 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac
NIPS
2004
13 years 9 months ago
Maximising Sensitivity in a Spiking Network
We use unsupervised probabilistic machine learning ideas to try to explain the kinds of learning observed in real neurons, the goal being to connect abstract principles of self-or...
Anthony J. Bell, Lucas C. Parra
TON
2002
144views more  TON 2002»
13 years 7 months ago
Algorithms for provisioning virtual private networks in the hose model
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, ...
IPSN
2005
Springer
14 years 1 months ago
A robust architecture for distributed inference in sensor networks
— Many inference problems that arise in sensor networks require the computation of a global conclusion that is consistent with local information known to each node. A large class...
Mark A. Paskin, Carlos Guestrin, Jim McFadden
ICC
2009
IEEE
197views Communications» more  ICC 2009»
14 years 2 months ago
A Game-Based Self-Organizing Uplink Tree for VoIP Services in IEEE 802.16j Networks
— In this paper, we propose a game theoretical approach to tackle the problem of the distributed formation of the uplink tree structure among the relay stations (RSs) and their s...
Walid Saad, Zhu Han, Mérouane Debbah, Are H...