Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
In this paper discrete quasi-copulas (defined on a square grid I2 n of [0,1]) are studied and it is proved that they can be represented by means of a special class of matrices wi...
Imaged-based rendering is a well-known method in computer graphics to achieve photo-realistic images. In this paper we show how conventional image-based rendering algorithms can b...
Recently, P.J. Cameron studied a class of block designs which generalises the classes of t-designs, -resolved 2-designs, orthogonal arrays, and other classes of combinatorial desi...
We present Apatite, a new tool that aids users in learning and understanding a complex API by visualizing the common associations between its various components. Current object-or...
Daniel S. Eisenberg, Jeffrey Stylos, Brad A. Myers