Sciweavers

3898 search results - page 212 / 780
» On the Bit Extraction Problem
Sort
View
121
Voted
JAIR
2006
87views more  JAIR 2006»
15 years 3 months ago
Fault Tolerant Boolean Satisfiability
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
Amitabha Roy
JTAER
2008
100views more  JTAER 2008»
15 years 3 months ago
Securing Uniqueness of Rights e-Documents: A Deontic Process Perspective
We typically think of documents as carrying information. However, certain kinds of documents do more than that: they are not only informative but also performative in that they re...
Ronald M. Lee, Vu Nguyen, Anastasia Pagnoni
TC
2008
15 years 3 months ago
Automatic Generation of Modular Multipliers for FPGA Applications
Since redundant number systems allow for constant time addition, they are often at the heart of modular multipliers designed for public key cryptography (PKC) applications. Indeed,...
Jean-Luc Beuchat, Jean-Michel Muller
TIT
2008
87views more  TIT 2008»
15 years 3 months ago
Decode-and-Forward Relaying With Quantized Channel State Feedback: An Outage Exponent Analysis
The problem of resource allocation to maximize the outage exponent over a fading relay channel using the decodeand-forward protocol with quantized channel state feedback (CSF) is s...
Thanh Tùng Kim, Giuseppe Caire, Mikael Skog...
TIT
1998
89views more  TIT 1998»
15 years 2 months ago
The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels
—We study the following problem: two agents Alice and Bob are connected to each other by independent discrete memoryless channels. They wish to generate common randomness, i.e., ...
Sivarama Venkatesan, Venkat Anantharam