Sciweavers

534 search results - page 21 / 107
» One more bit is enough
Sort
View
IJON
2002
123views more  IJON 2002»
13 years 7 months ago
N-bit parity neural networks: new solutions based on linear programming
In this paper, the N-bit parity problem is solved with a neural network that allows direct connections between the input layer and the output layer. The activation function used i...
Derong Liu, Myron E. Hohil, Stanley H. Smith
ICMCS
2008
IEEE
173views Multimedia» more  ICMCS 2008»
14 years 2 months ago
Improvement of the embedding efficiency of LSB matching by sum and difference covering set
As an important attribute directly influencing the steganographic scheme, the embedding efficiency is defined as the average number of random data bits per one embedding change...
Xiaolong Li, Tieyong Zeng, Bin Yang
EH
1999
IEEE
141views Hardware» more  EH 1999»
14 years 8 days ago
On-Line Evolution of FPGA-Based Circuits: A Case Study on Hash Functions
An evolutionary algorithm is used to evolve a digital circuit which computes a simple hash function mapping a 16bit address space into an 8-bit one. The target technology is FPGA,...
Ernesto Damiani, Andrea Tettamanzi, Valentino Libe...
IDMS
1998
Springer
141views Multimedia» more  IDMS 1998»
14 years 5 days ago
An Image Coding and Reconstruction Scheme for Mobile Computing
An asynchronous transfer mode (ATM) wireless network has bursty and high error rates. To combat the contiguous bit loss due to damaged or dropped packets, this paper presents a cod...
Edward Y. Chang
FCS
2006
13 years 9 months ago
Quantum Oblivious Transfer Based on POVM Measurements
- Oblivious transfer OT is an important primitive in cryptography. In chosen one-out-of-two OT, Alice offers two bits, one of which Bob can choose to read, not learning any informa...
Wei Yang, Liusheng Huang, Yonglong Luo, Mingjun Xi...