26 search results - page 3 / 6 » How to Achieve an Equivalent Simple Permutation in Linear Ti... |
AIPS
2008
13 years 8 months ago
2008
In this paper, we consider the problem of assisting a busy user in managing her workload of pending tasks. We assume that our user is typically oversubscribed, and is invariably j...
IPSN
2010
Springer
14 years 14 days ago
2010
Springer
We present Virtual High-resolution Time (VHT), a powerproportional time-keeping service that offers a baseline power draw of a low-speed clock (e.g. 32 kHz crystal), but provides...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
RTA
2005
Springer
13 years 11 months ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract--A delay-constrained scheduling problem for pointto-point communication is considered: a packet of B bits must be transmitted by a hard deadline of T slots over a timevary...