Sciweavers

3898 search results - page 349 / 780
» On the Bit Extraction Problem
Sort
View
CORR
2008
Springer
131views Education» more  CORR 2008»
15 years 4 months ago
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
Samir Datta, Raghav Kulkarni, Sambuddha Roy
CORR
2010
Springer
175views Education» more  CORR 2010»
15 years 4 months ago
Optimal Packet Scheduling in an Energy Harvesting Communication System
We consider the optimal packet scheduling problem in a single-user energy harvesting wireless communication system. In this system, both the data packets and the harvested energy ...
Jing Yang, Sennur Ulukus
CORR
2006
Springer
100views Education» more  CORR 2006»
15 years 4 months ago
How to beat the sphere-packing bound with feedback
The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless ...
Anant Sahai
140
Voted
EC
2006
136views ECommerce» more  EC 2006»
15 years 4 months ago
Error Thresholds in Genetic Algorithms
The error threshold of replication is an important notion of the quasispecies evolution model; it is a critical mutation rate (error rate) beyond which structures obtained by an e...
Gabriela Ochoa
IJNSEC
2008
103views more  IJNSEC 2008»
15 years 4 months ago
On Cipher Design Based on Switchable Controlled Operations
This paper concerns the problem of reducing the implementation cost of the switchable data-dependent operations (SDDOs) that are a new cryptographic primitive oriented to the desi...
Nikolay A. Moldovyan