3898 search results - page 29 / 780 » On the Bit Extraction Problem |
COR
2008
14 years 9 months ago
2008
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...
SPIRE
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
ASIACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
VLSI
2005
Springer
15 years 3 months ago
2005
Springer
This work addresses the problem of application mapping in networks-on-chip (NoCs) having as goal to minimize the total dynamic energy consumption of a complex system-on-a-chip (So...
DAGSTUHL
2006
14 years 11 months ago
2006
It is well known that unconditionally secure bit commitment is impossible even in the quantum world. In this paper a weak variant of quantum bit commitment, introduced independent...