8135 search results - page 358 / 1627 » networks 2008 |
159
click to vote
COMCOM
1998
15 years 6 months ago
1998
In this note, we show that a proposed secure broadcasting scheme is insecure. We also present a modified scheme to overcome this weakness. The modified scheme has the extra adva...
130
click to vote
DAM
1999
15 years 6 months ago
1999
Compound methods have been shown to be very e ective in the construction of broadcast graphs. Compound methods generate a large broadcast graph by combining multiple copies of a b...
193
click to vote
WINET
2002
15 years 6 months ago
2002
The complexity of the mobility tracking problem in a cellular environment has been characterized under an information-theoretic framework. Shannon's entropy measure is identif...
173
click to vote
IANDC
2008
15 years 5 months ago
2008
We show how to design secure authentication protocols for a non-standard class of scenarios. In these authentication is not bootstrapped from a PKI, shared secrets or trusted thir...
177
Voted
SCHEDULING
2010
15 years 5 months ago
2010
This paper reconsiders the PERT scheduling problem when information about task duration is incomplete. We model uncertainty on task durations by intervals. With this problem formu...