—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
We describe a new vector-based primitive for creating smoothshaded images, called the diffusion curve. A diffusion curve partitions the space through which it is drawn, defining d...
A recent paper [8] presented methods for several steps along the road to synthesis of realistic traffic matrices. Such synthesis is needed because traffic matrices are a crucial i...
This paper presents the Mitosis framework, which is a combined hardware-software approach to speculative multithreading, even in the presence of frequent dependences among threads....
Sign-selection uses a set of subcarrier signs to reduce the peak-to-average power ratio (PAR) of orthogonal-frequency-division multiplexing (OFDM). However, the computational compl...