—Many software engineering applications require points-to analysis. Client applications range from optimizing compilers to program development and testing environments to reverse...
— In this contribution, we analyze the bit error rate (BER) performance of fast frequency hopping (FFH) assisted M-ary frequency shift keying (MFSK) using product combining. Prod...
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
In [10], Misra introduced the powerlist data structure, which is well suited to express recursive, data-parallel algorithms. In particular, Misra showed how powerlists could be use...
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...