Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
Abstract. We propose an extension of the Restricted Boltzmann Machine (RBM) that allows the joint shape and appearance of foreground objects in cluttered images to be modeled indep...
Abstract. We present the first formalization of implementation straor first-class continuations. The formalization hinges on abstract machines for continuation-passing style (CPS) ...
Abstract--Support vector machines (SVMs) were initially proposed to solve problems with two classes. Despite the myriad of schemes for multiclassification with SVMs proposed since ...
Joaquim F. Pinto da Costa, Ricardo Sousa, Jaime S....
Abstract--Dynamic recompilation tries to produce more efficient code by exploiting runtime information. Virtual machines like the Jikes RVM use recompilation heuristics to decide h...