Sciweavers

625 search results - page 45 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
ESORICS
2009
Springer
15 years 6 months ago
Hide and Seek in Time - Robust Covert Timing Channels
Abstract. Covert timing channels aim at transmitting hidden messages by controlling the time between transmissions of consecutive payload packets in overt network communication. Pr...
Yali Liu, Dipak Ghosal, Frederik Armknecht, Ahmad-...
LISA
2000
15 years 1 months ago
Tracing Anonymous Packets to Their Approximate Source
Most denial-of-service attacks are characterized by a flood of packets with random, apparently valid source addresses. These addresses are spoofed, created by a malicious program ...
Hal Burch, Bill Cheswick
WISEC
2009
ACM
15 years 6 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
ESANN
2003
15 years 1 months ago
Fast approximation of the bootstrap for model selection
The bootstrap resampling method may be efficiently used to estimate the generalization error of a family of nonlinear regression models, as artificial neural networks. The main dif...
Geoffroy Simon, Amaury Lendasse, Vincent Wertz, Mi...
AEI
2000
120views more  AEI 2000»
14 years 11 months ago
A neural network approach for a robot task sequencing problem
This paper presents a neural network approach with successful implementation for the robot task-sequencing problem. The problem addresses the sequencing of tasks comprising loadin...
Oded Maimon, Dan Braha, Vineet Seth