400 search results - page 54 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
103
click to vote
DCOSS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
114
click to vote
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
CGF
2008
14 years 12 months ago
2008
We present a new algorithm for efficient occlusion culling using hardware occlusion queries. The algorithm significantly improves on previous techniques by making better use of te...
PODC
2010
ACM
15 years 3 months ago
2010
ACM
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with...
109
click to vote
VISUALIZATION
2005
IEEE
15 years 5 months ago
2005
IEEE
Existing parallel or remote rendering solutions rely on communicating pixels, OpenGL commands, scene-graph changes or application-specific data. We propose an intermediate soluti...