- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
This correspondence presents new approaches for optimizing kurtosis-based separation criteria in the case of long mixture recordings. Our methods are based on a multivariate polyno...
We present an approach for nonlinear optimization of the parameters of an endoscopic camera mounted on a surgery robot. The goal is to generate a depth map for each image in order...
From a rare events perspective, scheduling disciplines that work well under light (exponential) tailed workload distributions do not perform well under heavy (power) tailed worklo...
We present an efficient method for volume rendering by raycasting on the CPU. We employ coherent packet traversal of an implicit bounding volume hierarchy, heuristically pruned u...
Aaron Knoll, Sebastian Thelen, Ingo Wald, Charles ...