441 search results - page 29 / 89 » A Method for Proving Observational Equivalence |
TLCA
2005
Springer
14 years 2 months ago
2005
Springer
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
— This paper presents a novel distributed estimation algorithm based on the concept of moving horizon estimation. Under weak observability conditions we prove convergence of the ...
ICRA
2006
IEEE
14 years 2 months ago
2006
IEEE
— In this paper, we present a delayed algorithm for landmark initialization based on a Scaled Unscented Filter. The algorithm efficiently gives well-conditioned feature location...
ICFP
2010
ACM
13 years 10 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
PKDD
2009
Springer
14 years 3 months ago
2009
Springer
A frequent problem in density level-set estimation is the choice of the right features that give rise to compact and concise representations of the observed data. We present an e...