The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
Realistic rendering of materials such as milk, fruits, wax, marble, and so on, requires the simulation of subsurface scattering of light. This paper presents an algorithm for plau...
Tom Mertens, Jan Kautz, Philippe Bekaert, Hans-Pet...
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...
The anatomy, function and hemodynamics of the aortic and mitral valves are known to be strongly interconnected. An integrated quantitative and visual assessment of the aortic-mitra...
Razvan Ioan Ionasec, Ingmar Voigt, Bogdan George...
Results clustering in Web Searching is useful for providing users with overviews of the results and thus allowing them to restrict their focus to the desired parts. However, the ta...