Sciweavers

2372 search results - page 170 / 475
» Probabilistic calling context
Sort
View
117
Voted
ICML
2010
IEEE
15 years 3 months ago
The Translation-invariant Wishart-Dirichlet Process for Clustering Distance Data
We present a probabilistic model for clustering of objects represented via pairwise dissimilarities. We propose that even if an underlying vectorial representation exists, it is b...
Julia E. Vogt, Sandhya Prabhakaran, Thomas J. Fuch...
116
Voted
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 2 months ago
Computing the Least Fixed Point of Positive Polynomial Systems
We consider equation systems of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where f1, . . . , fn are polynomials with positive real coefficients. In vector fo...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
140
Voted
TSMC
2008
122views more  TSMC 2008»
15 years 2 months ago
A Geometric Approach to the Theory of Evidence
In this paper, we propose a geometric approach to the theory of evidence based on convex geometric interpretations of its two key notions of belief function (b.f.) and Dempster...
Fabio Cuzzolin
111
Voted
AROBOTS
2004
99views more  AROBOTS 2004»
15 years 2 months ago
Bayesian Robot Programming
We propose a new method to program robots based on Bayesian inference and learning. It is called BRP for Bayesian Robot Programming. The capacities of this programming method are d...
Olivier Lebeltel, Pierre Bessière, Julien D...
160
Voted
ML
1998
ACM
153views Machine Learning» more  ML 1998»
15 years 2 months ago
Bayesian Landmark Learning for Mobile Robot Localization
To operate successfully in indoor environments, mobile robots must be able to localize themselves. Most current localization algorithms lack flexibility, autonomy, and often optim...
Sebastian Thrun