We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
We present a method for the rapid and controllable simulation of the shattering of brittle objects under impact. An object to be broken is represented as a set of point masses con...
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
We present a new method for accelerating the rendering of complex static scenes. The technique is applicable to unstructured scenes containing arbitrary geometric primitives and h...
Bradford L. Chamberlain, Tony DeRose, Dani Lischin...
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...
Junzhou Huang, Shaoting Zhang, Dimitris N. Metaxas