Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
We present an algorithm for constructing kd-trees on GPUs. This algorithm achieves real-time performance by exploiting the GPU's streaming architecture at all stages of kd-tr...
In this paper, we present an approach for monitoring the positions of vector field singularities in time-dependent datasets. The concept of singularity index is discussed and exte...
Christoph Garth, Xavier Tricoche, Gerik Scheuerman...
Stereo algorithms for structure reconstruction demand accurate disparities with low mismatch errors and false positives. Mismatch errors in large textureless regions force most ac...
Cathleen A. Geiger, Chandra Kambhamettu, Gowri Som...