Sciweavers

914 search results - page 66 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
PAMI
2011
13 years 1 months ago
Hidden Part Models for Human Action Recognition: Probabilistic versus Max Margin
—We present a discriminative part-based approach for human action recognition from video sequences using motion features. Our model is based on the recently proposed hidden condi...
Yang Wang 0003, Greg Mori
ENTCS
2007
110views more  ENTCS 2007»
13 years 10 months ago
A Bayesian Model for Event-based Trust
The application scenarios envisioned for ‘global ubiquitous computing’ have unique requirements that are often incompatible with traditional security paradigms. One alternativ...
Mogens Nielsen, Karl Krukow, Vladimiro Sassone
AIPS
2009
13 years 12 months ago
Information-Theoretic Approach to Efficient Adaptive Path Planning for Mobile Robotic Environmental Sensing
Recent research in robot exploration and mapping has focused on sampling environmental hotspot fields. This exploration task is formalized by Low, Dolan, and Khosla (2008) in a se...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla
FDG
2009
ACM
14 years 5 months ago
Indicative routes for path planning and crowd simulation
An important challenge in virtual environment applications is to steer virtual characters through complex and dynamic worlds. The characters should be able to plan their paths and...
Ioannis Karamouzas, Roland Geraerts, Mark H. Overm...
AIPS
2009
13 years 12 months ago
Multi-Agent Online Planning with Communication
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen