Sciweavers

1069 search results - page 173 / 214
» Quantum Channel Capacities
Sort
View
MM
2000
ACM
112views Multimedia» more  MM 2000»
14 years 8 days ago
How to bypass the Wassenaar arrangement: a new application for watermarking
The scope of this article is to clarify the current legal and political situation related to electronic surveillance on the one hand, and to export regulations for encryption soft...
Franck Leprévost, Raphaël Erard, Toura...
PKC
2010
Springer
179views Cryptology» more  PKC 2010»
13 years 12 months ago
Preventing Pollution Attacks in Multi-source Network Coding
Network coding is a method for achieving channel capacity in networks. The key idea is to allow network routers to linearly mix packets as they traverse the network so that recipi...
Shweta Agrawal, Dan Boneh, Xavier Boyen, David Man...
IC
2001
13 years 9 months ago
The SMART Project Exploiting the Heterogeneous Mobile World
The wide proliferation of wireless systems and the use of software radio technologies enables the employment of a heterogeneous network. In this concept services are delivered via...
Paul J. M. Havinga, Gerard J. M. Smit, Lars Kristi...
UAI
2001
13 years 9 months ago
Iterative Markov Chain Monte Carlo Computation of Reference Priors and Minimax Risk
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
John D. Lafferty, Larry A. Wasserman
WSS
1997
112views Control Systems» more  WSS 1997»
13 years 9 months ago
Propagated timestamps: a scheme for the stabilization of maximum-flow routing protocols
We present a distributed protocol for maintaining a maximum flow spanning tree in a network, with a designated node as the root of the tree. This maximum flow spanning tree can be...
Jorge Arturo Cobb, Mohamed Waris