We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
Interactive visualization of complex, real-world light sources has so far not been feasible. In this paper, we present an hardware accelerated direct lighting algorithm based on a...
Xavier Granier, Michael Goesele, Wolfgang Heidrich...
Volume illustration is a developing trend in volume visualization, focused on conveying volume information effectively by enhancing interesting features of the volume and omitting...
We describe a question answering system for Dutch that we used for our participation in the 2006 CLEF Question Answering Dutch monolingual task. We give an overview of the system a...
David Ahn, Valentin Jijkoun, Joris van Rantwijk, M...
In this paper we describe recent improvements to components and methods used in our statistical machine translation system for ChineseEnglish used in the January 2008 GALE evaluat...
Almut Silja Hildebrand, Kay Rottmann, Mohamed Noam...