459 search results - page 46 / 92 » Computational Complexity of Probabilistic Disambiguation |
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. Foreground and background segmentation is a typical problem in computer vision and medical imaging. In this paper, we propose a new learning based approach for 3D segment...
ICRA
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract— We present a novel algorithm for motion planning of a deformable robot in a static environment. Given the initial and final configuration of the robot, our algorithm ...
187
click to vote
DCOSS
2011
Springer
13 years 11 months ago
2011
Springer
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
110
click to vote
PKDD
2009
Springer
15 years 6 months ago
2009
Springer
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...
DOLAP
2006
ACM
15 years 5 months ago
2006
ACM
Motivated by the increasing need to analyze complex, uncertain multidimensional data this paper proposes probabilistic OLAP queries that are computed using probability distributio...