Sciweavers

2945 search results - page 169 / 589
» Noisy Network Coding
Sort
View
SIGCOMM
1996
ACM
15 years 11 months ago
DPF: Fast, Flexible Message Demultiplexing Using Dynamic Code Generation
Fast and flexible message demultiplexing are well-established goals in the networking community [1, 18, 22]. Currently, however, network architects have had to sacrifice one for t...
Dawson R. Engler, M. Frans Kaashoek
ICC
2007
IEEE
104views Communications» more  ICC 2007»
16 years 1 months ago
Time-and-Frequency-Hopping Optical Orthogonal Codes with Hierarchical Cross-Correlation Constraints for Service Differentiation
— In this paper, we consider time-and-frequency hopping (TFH) codes for optical code-division multiple-access (OCDMA) networks. To support the differentiated service requirements...
Chung-Keun Lee, Seung-Woo Seo
PERCOM
2008
ACM
16 years 6 months ago
A tamper-proof and lightweight authentication scheme
We present a tamper-proof and lightweight challenge-response authentication scheme based on 2-level noisy Physically Unclonable Functions (PUF). We present a security reduction, w...
Ghaith Hammouri, Erdinç Öztürk, Berk Sunar
IJCNN
2008
IEEE
16 years 1 months ago
Robust modular ARTMAP for multi-class shape recognition
— This paper presents a Fuzzy ARTMAP (FAM) based modular architecture for multi-class pattern recognition known as Modular Adaptive Resonance Theory Map (MARTMAP). The prediction...
Chue Poh Tan, Chen Change Loy, Weng-Kin Lai, Chee ...
SBRN
2008
IEEE
16 years 1 months ago
Imitation Learning of an Intelligent Navigation System for Mobile Robots Using Reservoir Computing
The design of an autonomous navigation system for mobile robots can be a tough task. Noisy sensors, unstructured environments and unpredictability are among the problems which mus...
Eric A. Antonelo, Benjamin Schrauwen, Dirk Strooba...