The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
We consider "swept regions" and "swept hypersurfaces"B in Rn+1 (and especially R3) which are a disjoint union of subspaces t = t or Bt = Bt obtained from a va...
This paper presents a real-time rendering pipeline for implicit surfaces defined by a regular volumetric grid of samples. We use a ray-casting approach on current graphics hardwar...
Markus Hadwiger, Christian Sigg, Henning Scharsach...
Internet transmission and switching facilities are partitioned into different administrative domains. To effect routing between domains, domain border routers establish pairwise p...