Sciweavers

2324 search results - page 105 / 465
» A Fast Keyword-Spotting Technique
Sort
View
AIPS
2006
14 years 11 months ago
Fast Probabilistic Planning through Weighted Model Counting
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...
Carmel Domshlak, Jörg Hoffmann
GRAPHICSINTERFACE
2000
14 years 11 months ago
Fast and Controllable Simulation of the Shattering of Brittle Objects
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...
Jeffrey Smith, Andrew P. Witkin, David Baraff
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
14 years 11 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
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 ...
David Eppstein
GRAPHICSINTERFACE
1996
14 years 11 months ago
Fast Rendering of Complex Environments Using a Spatial Hierarchy
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...
ECCV
2010
Springer
14 years 11 months ago
Fast Optimization for Mixture Prior Models
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