Sciweavers

198 search results - page 23 / 40
» Dynamic spatial approximation trees
Sort
View
EGH
2011
Springer
12 years 9 months ago
Simpler and Faster HLBVH with Work Queues
A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tr...
Kirill Garanzha, Jacopo Pantaleoni, David K. McAll...
AAAI
2010
13 years 11 months ago
Symbolic Dynamic Programming for First-order POMDPs
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
Scott Sanner, Kristian Kersting
SIAMCOMP
2000
97views more  SIAMCOMP 2000»
13 years 9 months ago
Dynamic Maintenance of Maxima of 2-d Point Sets
This paper describes an efficient scheme for the dynamic maintenance of the set of maxima of a 2-d set of points. Using the fact that the maxima can be stored in a staircase struct...
Sanjiv Kapoor
SIAMAM
2000
128views more  SIAMAM 2000»
13 years 9 months ago
Advection-Diffusion Equations for Internal State-Mediated Random Walks
Abstract. In many biological examples of biased random walks, movement statistics are determined by state dynamics that are internal to the organism or cell and that mediate respon...
Daniel Grünbaum
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 4 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos