We speed up the rendering of participating media with Virtual Ray Lights (VRLs) by clustering them in a preprocessing step. A subset of representative VRLs is then sampled from the clustering, which is used for the final rendering. By performing a full variance analysis, we can explicitly estimate the convergence rate of the rendering process and automatically find the locally ideal number of c...

In this paper we deal with a pseudo-Boolean representation of the simple plant location problem. We define instances of this problem that are equivalent, in the sense that each feasible solution has the same goal function value in all such instances. We further define a collection of polytopes whose union describes the set of instances equivalent to a given instance. We use the concept of equiv...

Glaucoma is one of the most common causes of blindness and it is becoming even more important considering the ageing society. Because healing of died retinal nerve fibers is not possible early detection and prevention is essential. Robust, automated mass-screening will help to extend the symptom-free life of affected patients. We devised a novel, automated, appearance based glaucoma classificat...

This contribution presents the evaluation methodology for the identification of potential “sexual predators” in online conversations as part of PAN 2012. We provide details of the realized collection and analyse the submissions of the participants, who had to solve two problems: identify the predators among all the users in the different conversations and identify the part (the lines) of the pr...

Much research is in progress on the acquisition of high-density three-dimensional shapes by acquiring and combining shape data and normal data. The method proposed in this paper estimates normals to object surfaces by employing the photometric stereo method and combines the estimation with the three-dimensional shape acquired by a laser range sensor. Although the photometric stereo method presu...

A classical problem in the mining industry for open-pit mines involves scheduling the production of notional three-dimensional production blocks, each containing a predetermined amount of ore and waste. That is, given operational resource constraints on extraction and processing, we seek a net present value-maximizing schedule of when, if ever, to extract each block in a deposit. We present a v...

where An,i(X) ≡ we are confident in both estimates fn,h(X ± tei). •Fast preprocessing, and online: just 2 estimates of fn,h at X . Metric learning optimizes over a space of possible metrics. •Only 2× 2× 1 param. search grid to adapt to d dimensions. KR with bandwidths {hi}d1 needs d× d param. search grid. •General: preprocessing for any distance-based regressor. Other methods apply to particula...