Sciweavers

6110 search results - page 1158 / 1222
» Approximate Computing
Sort
View
WG
2010
Springer
15 years 1 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
MOBIHOC
2010
ACM
15 years 26 days ago
Near optimal multi-application allocation in shared sensor networks
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
You Xu, Abusayeed Saifullah, Yixin Chen, Chenyang ...
VRST
2010
ACM
15 years 25 days ago
Region-of-interest volumetric visual hull refinement
This paper introduces a region-of-interest visual hull refinement technique, based on flexible voxel grids for volumetric visual hull reconstructions. Region-of-interest refinemen...
Daniel Knoblauch, Falko Kuester
WAOA
2010
Springer
236views Algorithms» more  WAOA 2010»
15 years 25 days ago
The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers
We study an extension of the unit-demand pricing problem in which the seller may offer bundles of items. If a customer buys such a bundle she is guaranteed to get one item out of i...
Patrick Briest, Heiko Röglin
EGH
2009
Springer
15 years 23 days ago
Efficient ray traced soft shadows using multi-frusta tracing
Ray tracing has long been considered to be superior to rasterization because its ability to trace arbitrary rays, allowing it to simulate virtually any physical light transport ef...
Carsten Benthin, Ingo Wald
« Prev « First page 1158 / 1222 Last » Next »