Sciweavers

1089 search results - page 14 / 218
» Randomness and Reducibility
Sort
View
APAL
2007
88views more  APAL 2007»
13 years 7 months ago
Randomness and the linear degrees of computability
We show that there exists a real α such that, for all reals β, if α is linear reducible to β (α ≤ β, previously denoted α ≤sw β) then β ≤T α. In fact, every random ...
Andrew E. M. Lewis, George Barmpalias
IPPS
1998
IEEE
13 years 12 months ago
Sharing Random Bits with No Process Coordination
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
Marius Zimand
ITC
1996
IEEE
98views Hardware» more  ITC 1996»
13 years 12 months ago
Mixed-Mode BIST Using Embedded Processors
Abstract. In complex systems, embedded processors may be used to run software routines for test pattern generation and response evaluation. For system components which are not comp...
Sybille Hellebrand, Hans-Joachim Wunderlich, Andre...
ICC
2007
IEEE
142views Communications» more  ICC 2007»
14 years 2 months ago
Turbo Codes Based Image Transmission for Channels with Both Random Errors and Packet Loss
Abstract— In this paper, we propose an unequal error protection (UEP) framework for progressive image transmission over wireless networks with both random errors and packet loss....
Lei Yao, Lei Cao
ASIACRYPT
2006
Springer
13 years 11 months ago
HIBE With Short Public Parameters Without Random Oracle
Abstract. At Eurocrypt 2005, Waters presented an identity based encryption (IBE) protocol which is secure in the full model without random oracle. In this paper, we extend Waters&#...
Sanjit Chatterjee, Palash Sarkar