Sciweavers

1450 search results - page 198 / 290
» On the Complexity of Hardness Amplification
Sort
View
PODC
2005
ACM
14 years 3 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
IUI
2004
ACM
14 years 3 months ago
Sheepdog: learning procedures for technical support
Technical support procedures are typically very complex. Users often have trouble following printed instructions describing how to perform these procedures, and these instructions...
Tessa A. Lau, Lawrence D. Bergman, Vittorio Castel...
PLDI
2004
ACM
14 years 3 months ago
KISS: keep it simple and sequential
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
Shaz Qadeer, Dinghao Wu
VRST
2004
ACM
14 years 3 months ago
A CAVE system for interactive modeling of global illumination in car interior
Global illumination dramatically improves realistic appearance of rendered scenes, but usually it is neglected in VR systems due to its high costs. In this work we present an effi...
Kirill Dmitriev, Thomas Annen, Grzegorz Krawczyk, ...
RT
2004
Springer
14 years 3 months ago
Real-time appearance preserving out-of-core rendering with shadows
Despite recent advances in finding efficient LOD-representations for gigantic 3D objects, rendering of complex, gigabyte-sized models and environments is still a challenging tas...
Michael Guthe, Pavel Borodin, Ákos Bal&aacu...