Many applications in wireless sensor networks rely on data from neighboring nodes. However, the effort for developing efficient solutions for sharing data in the neighborhood is of...
Andreas Lachenmann, Daniel Minder, Kurt Rothermel,...
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
This paper presents an efficient inference algorithm of conditional random fields (CRFs) for large-scale data. Our key idea is to decompose the output label state into an active s...
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We d...
A novel approach is presented to efficiently render local subsurface scattering effects. We introduce an importance sampling scheme for a practical subsurface scattering model. It...
Tom Mertens, Jan Kautz, Philippe Bekaert, Frank Va...