Sciweavers

5170 search results - page 279 / 1034
» Consistency of the FastSLAM Algorithm
Sort
View
POPL
2007
ACM
16 years 2 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
UAI
1997
15 years 3 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 11 months ago
QIP = PSPACE
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and Jo...
ICML
2009
IEEE
15 years 8 months ago
Rule learning with monotonicity constraints
In classification with monotonicity constraints, it is assumed that the class label should increase with increasing values on the attributes. In this paper we aim at formalizing ...
Wojciech Kotlowski, Roman Slowinski
ICPR
2008
IEEE
15 years 8 months ago
A non-parametric scale-based corner detector
This paper introduces a new Harris-affine corner detector algorithm, that does not need parameters to locate corners in images, given an observation scale. Standard detectors req...
Fabio Bellavia, Domenico Tegolo, Cesare Valenti