Students rated 16 tutorial statements on negative politeness (i.e., how much the tutor ``allows me freedom to make my own decisions'') and positive politeness (i.e., how...
Richard E. Mayer, W. Lewis Johnson, Erin Shaw, Sah...
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
We solve the problem of computing global conformal parameterizations for surfaces with nontrivial topologies. The parameterization is global in the sense that it preserves the con...
We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Mink...