Sciweavers

198 search results - page 8 / 40
» Dynamic spatial approximation trees
Sort
View
NHM
2010
89views more  NHM 2010»
13 years 4 months ago
Quasistatic evolution for Cam-Clay plasticity: The spatially homogeneous case
We study the spatially uniform case of the problem of quasistatic evolution in small strain nonassociative elastoplasticity (Cam-Clay model). Through the introdution of a viscous a...
Gianni Dal Maso, Francesco Solombrino
NIPS
2003
13 years 11 months ago
Applying Metric-Trees to Belief-Point POMDPs
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
AINA
2005
IEEE
14 years 3 months ago
Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko
CGF
2010
181views more  CGF 2010»
13 years 8 months ago
Matrix Trees
Recent advances in GPU programmability and architecture have allowed for the generation of ray casted or ray traced images at interactive rates. How quickly these images can be ge...
Nathan Andrysco, Xavier Tricoche
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 10 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb