Sciweavers

1092 search results - page 102 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
IJAR
2010
91views more  IJAR 2010»
15 years 4 months ago
Logical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Mathias Niepert, Dirk Van Gucht, Marc Gyssens
AIM
2000
15 years 5 months ago
Probabilistic Algorithms in Robotics
This article describes a methodology for programming robots known as probabilistic robotics. The probabilistic paradigm pays tribute to the inherent uncertainty in robot perceptio...
Sebastian Thrun
KBSE
1999
IEEE
15 years 10 months ago
Modular and Incremental Analysis of Concurrent Software Systems
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
Hassen Saïdi
CVPR
2007
IEEE
16 years 8 months ago
Autocalibration via Rank-Constrained Estimation of the Absolute Quadric
We present an autocalibration algorithm for upgrading a projective reconstruction to a metric reconstruction by estimating the absolute dual quadric. The algorithm enforces the ra...
Manmohan Krishna Chandraker, Sameer Agarwal, Fredr...
CLUSTER
2001
IEEE
15 years 9 months ago
The Master-Slave Paradigm with Heterogeneous Processors
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
Olivier Beaumont, Arnaud Legrand, Yves Robert