459 search results - page 78 / 92 » Computational Complexity of Probabilistic Disambiguation |
111
Voted
IVA
2010
Springer
15 years 2 months ago
2010
Springer
We describe a new organization for virtual human responses to dynamically occurring events. In our approach behavioral responses are enumerated in the representation of the event i...
147
Voted
AI
2011
Springer
14 years 10 months ago
2011
Springer
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...
155
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We consider the problem of tracking a maneuvering target in urban terrain with high clutter. Although multipath has been previously exploited to improve target tracking in complex...
183
click to vote
AI
2011
Springer
14 years 7 months ago
2011
Springer
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...
134
Voted
AAAI
2011
14 years 3 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...