Sciweavers

914 search results - page 152 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
ICASSP
2011
IEEE
13 years 18 days ago
Urban terrain tracking in high clutter with waveform-agility
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...
Bhavana Chakraborty, Jun Jason Zhang, Antonia Papa...
AI
2011
Springer
13 years 15 days ago
Parallelizing a Convergent Approximate Inference Method
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...
Ming Su, Elizabeth Thompson
AAAI
2011
12 years 9 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
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...
Andrew Gelfand, Kalev Kask, Rina Dechter
ECCV
2010
Springer
12 years 3 months ago
Voting by Grouping Dependent Parts
Hough voting methods efficiently handle the high complexity of multiscale, category-level object detection in cluttered scenes. The primary weakness of this approach is however t...
Pradeep Yarlagadda, Antonio Monroy and Bjorn Ommer
EMMCVPR
2007
Springer
14 years 3 months ago
Compositional Object Recognition, Segmentation, and Tracking in Video
Abstract. The complexity of visual representations is substantially limited by the compositional nature of our visual world which, therefore, renders learning structured object mod...
Björn Ommer, Joachim M. Buhmann