: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Mergin...
Jason Cong, Andrew B. Kahng, Cheng-Kok Koh, Chung-...
{DSP algorithms in most cases are subject to hard real-time constraints. In case of programmable DSP processors, meeting those constraints must be ensured by appropriate code gener...
Wedescribe a case study in data miningfor personal loan evaluation, performed at the ABNAMRObank in the Netherlands. Historical data of clients and their pay-backbehaviourare used...
A. J. Feelders, A. J. F. le Loux, J. W. van't Zand
We present a scheme to guarantee that the execution of real-time tasks can tolerate transient and intermittent faults assuming any queue- based scheduling technique. The scheme is...
We present an algorithm that accelerates the extraction of iso-surfaces from unstructured grids by avoiding the traversal of the entire set of cells in the volume. The algorithm c...