Sciweavers

528 search results - page 60 / 106
» Fault-tolerant analysis of a class of networks
Sort
View
131
Voted
TIFS
2008
208views more  TIFS 2008»
15 years 17 days ago
A Network Coding Approach to Secret Key Distribution
We consider the problem of secret key distribution in a sensor network with multiple scattered sensor nodes and a mobile device that can be used to bootstrap the network. Our main...
Paulo F. Oliveira, João Barros
96
Voted
TMC
2010
109views more  TMC 2010»
14 years 11 months ago
On the Performance Bounds of Practical Wireless Network Coding
—Network coding is an attracting technology that has been shown to be able to improve the throughput of wireless networks. However, there still lacks fundamental understanding on...
Jilin Le, John C. S. Lui, Dah-Ming Chiu
118
Voted
VALUETOOLS
2006
ACM
149views Hardware» more  VALUETOOLS 2006»
15 years 6 months ago
Tail asymptotics for discrete event systems
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
Marc Lelarge
93
Voted
NIPS
2000
15 years 2 months ago
Processing of Time Series by Neural Circuits with Biologically Realistic Synaptic Dynamics
Experimental data show that biological synapses behave quite differently from the symbolic synapses in common artificial neural network models. Biological synapses are dynamic, i....
Thomas Natschläger, Wolfgang Maass, Eduardo D...
PE
2010
Springer
170views Optimization» more  PE 2010»
14 years 11 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale