914 search results - page 71 / 183 » The Computational Complexity of Probabilistic Planning |
INFORMATICALT
2007
13 years 10 months ago
2007
A modified version of the Bellare and Rogaway (1993) adversarial model is encoded using Asynchronous Product Automata (APA). A model checker tool, Simple Homomorphism Verificatio...
TVCG
2008
13 years 10 months ago
2008
The effective visualization of vascular structures is critical for diagnosis, surgical planning as well as treatment evaluation. In recent work, we have developed an algorithm for ...
IANDC
2008
13 years 10 months ago
2008
We introduce two resource-bounded Baire category notions on small complexity classes such as P, QUASIPOLY, SUBEXP and PSPACE and on probabilistic classes such as BPP, which differ...
C5
2008
IEEE
14 years 5 months ago
2008
IEEE
We present a new basic metaphors and concepts for authoring environments by distinguishing between content and form. By distinguishing between planning the scope of action (conten...
ICCV
2001
IEEE
15 years 21 days ago
2001
IEEE
This paper describes a framework for learning probabilistic models of objects and scenes and for exploiting these models for tracking complex, deformable, or articulated objects i...