Sciweavers

99 search results - page 8 / 20
» Analysis of the Linux Random Number Generator
Sort
View
CN
2010
121views more  CN 2010»
14 years 8 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...
IJNSEC
2011
145views more  IJNSEC 2011»
14 years 6 months ago
Symmetric Key Image Encryption Scheme with Key Sequences Derived from Random Sequence of Cyclic Elliptic Curve Points
In this paper, cyclic elliptic curves of the form y2 + xy = x3 + ax2 + b, a, b ∈ GF(2m ) with order M is considered in the design of a Symmetric Key Image Encryption Scheme with...
S. V. Sathyanarayana, M. Aswatha Kumar, K. N. Hari...
SPAA
2010
ACM
14 years 12 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
TWC
2008
133views more  TWC 2008»
14 years 11 months ago
Beam Selection Strategies for Orthogonal Random Beamforming in Sparse Networks
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...
José López Vicario, Roberto Bosisio,...
ICNS
2007
IEEE
15 years 6 months ago
A Case Study-based Performance Evaluation Framework for CSCF Processes on a Blade-Server
Abstract— The study of protocol behavior and traffic characteristics in a simulated environment is commonly supported by ad-hoc or general purpose simulators (e.g., Opnet, NS-2)...
Preetam Ghosh, Nirmalya Roy, Kalyan Basu, Sajal K....