374 search results - page 72 / 75 » On Communicating Automata with Bounded Channels |
WCNC
2008
IEEE
14 years 1 months ago
2008
IEEE
—We study a cognitive network consisting of multiple cognitive users communicating in the presence of a single primary user. The primary user is located at the center of the netw...
CONCUR
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. Discretionary Access Control (DAC) systems provide powerful mechanisms for resource management based on the selective distribution of capabilities to selected classes of ...
CP
2003
Springer
14 years 19 days ago
2003
Springer
This work introduces a combinatorial optimization problem called Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency program Mars Express. It c...
TIT
1998
13 years 7 months ago
1998
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...