3 search results - page 1 / 1 » Verifying Fast and Sparse SSA-Based Optimizations in Coq |
CADE
2008
Springer
14 years 5 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
This paper studies the problem of simultaneously aligning a batch of linearly correlated images despite gross corruption (such as occlusion). Our method seeks an optimal set of im...
IROS
2007
IEEE
13 years 11 months ago
2007
IEEE
— We present an algorithm for pose estimation using fixed-lag smoothing. We show that fixed-lag smoothing enables inclusion of measurements from multiple asynchronous measureme...