459 search results - page 17 / 92 » Computational Complexity of Probabilistic Disambiguation |
DC
2000
14 years 11 months ago
2000
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
ICRA
2007
IEEE
15 years 6 months ago
2007
IEEE
— This paper describes a probabilistic framework for navigation using only appearance data. By learning a generative model of appearance, we can compute not only the similarity o...
45
Voted
ICPR
2010
IEEE
15 years 1 months ago
2010
IEEE
We present a methodology for learning spline-based probabilistic models for sets of contours, proposing a new Monte Carlo variant of the EM algorithm to estimate the parameters of...
QCQC
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
107
click to vote
ECP
1997
Springer
15 years 3 months ago
1997
Springer
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...