Sciweavers

8259 search results - page 299 / 1652
» On Generalized Feistel Networks
Sort
View
LCN
2006
IEEE
16 years 23 days ago
On Measuring Anonymity For Wireless Mobile Ad-hoc Networks
We propose an evidence theory based anonymity measuring approach for wireless mobile ad-hoc networks. In our approach, an evidence is a measure of the number of detected packets w...
Dijiang Huang
ISAAC
2003
Springer
97views Algorithms» more  ISAAC 2003»
15 years 12 months ago
Equilibria for Networks with Malicious Users
We consider the problem of characterizing user equilibria and optimal solutions for selfish routing in a given network. We extend the known models by considering malicious behavio...
George Karakostas, Anastasios Viglas
BROADNETS
2004
IEEE
15 years 10 months ago
Power Save Mechanisms for Multi-Hop Wireless Networks
In this paper, we discuss power save mechanisms that allow hosts to go to sleep to conserve energy. When sleeping hosts need to receive packets from other hosts. Thus, these hosts...
Matthew J. Miller, Nitin H. Vaidya
ESANN
2008
15 years 8 months ago
A Regularized Learning Method for Neural Networks Based on Sensitivity Analysis
The Sensitivity-Based Linear Learning Method (SBLLM) is a learning method for two-layer feedforward neural networks, based on sensitivity analysis, that calculates the weights by s...
Bertha Guijarro-Berdiñas, Oscar Fontenla-Ro...
ESANN
2003
15 years 8 months ago
Robust Topology Representing Networks
Martinetz and Schulten proposed the use of a Competitive Hebbian Learning (CHL) rule to build Topology Representing Networks. From a set of units and a data distribution, a link i...
Michaël Aupetit