156 search results - page 22 / 32 » On the Round Complexity of Covert Computation |
VTC
2008
IEEE
14 years 1 months ago
2008
IEEE
— This paper studies the optimization techniques for scheduling multimedia packets in satellite digital multimedia broadcasting system, namely SDMB, in the presence of a return l...
VLSID
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper presents Frame Based Fair Multiprocessor Scheduler (FBFMS) which provides accurate real-time proportional fair scheduling for a set of dynamic tasks on a symmetric mult...
ISCAS
2003
IEEE
14 years 20 days ago
2003
IEEE
The hardware complexity of digital filters is not controllable by straightforwardly rounding the coefficients to the quantization levels. In this paper, we propose an effective al...
IJISEC
2006
13 years 7 months ago
2006
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Do...