We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
The bandwidth and latency of a memory system are strongly dependent on the manner in which accesses interact with the “3-D” structure of banks, rows, and columns characteristi...
Scott Rixner, William J. Dally, Ujval J. Kapasi, P...
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
We present a new scheduling algorithm, which is a synthesis of all the remarkable features of pretransmission coordination-based protocols for broadcast and select star networks. ...
Panagiotis G. Sarigiannidis, Georgios I. Papadimit...
—Channel-aware scheduling strategies - such as the CDF Scheduler (CS) algorithm for the CDMA/HDR systems provide an effective mechanism for utilizing the channel data rate for im...