2095 search results - page 223 / 419 » Improved pebbling bounds |
168
click to vote
CGF
2008
15 years 6 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...
177
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...
190
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
190
click to vote
CAGD
2006
15 years 6 months ago
2006
This paper describes a comprehensive approach to construct quality meshes for implicit solvation models of biomolecular structures starting from atomic resolution data in the Prot...
141
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
How to find a cooperative diversity scheme that achieves the transmit diversity bound is still an open problem. In fact, all previously proposed amplify-and-forward (AF) and decod...