Sciweavers

13214 search results - page 71 / 2643
» Pseudorandomness for network algorithms
Sort
View
ASIACRYPT
2006
Springer
15 years 10 months ago
On the (In)security of Stream Ciphers Based on Arrays and Modular Addition
Abstract. Stream ciphers play an important role in symmetric cryptology because of their suitability in high speed applications where block ciphers fall short. A large number of fa...
Souradyuti Paul, Bart Preneel
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 10 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
ADHOCNOW
2008
Springer
16 years 19 days ago
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
Michael Elkin, Yuval Lando, Zeev Nutov, Michael Se...
IPPS
2007
IEEE
16 years 17 days ago
Evolution of Strategy Driven Behavior in Ad Hoc Networks Using a Genetic Algorithm
In this paper we address the problem of selfish behavior in ad hoc networks. We propose a strategy driven approach which aims at enforcing cooperation between network participant...
Marcin Seredynski, Pascal Bouvry, Mieczyslaw A. Kl...
ICANN
2009
Springer
15 years 11 months ago
An EM Based Training Algorithm for Recurrent Neural Networks
Recurrent neural networks serve as black-box models for nonlinear dynamical systems identification and time series prediction. Training of recurrent networks typically minimizes t...
Jan Unkelbach, Yi Sun, Jürgen Schmidhuber