Sciweavers

175 search results - page 2 / 35
» A Complete and Recursive Feature Theory
Sort
View
ICCV
1995
IEEE
14 years 2 months ago
Complete Scene Structure from Four Point Correspondences
A new technique is presented for computing 3D scene structure from point and line features in monocular image sequences. Unlike previous methods, the technique guarantees the comp...
Steven M. Seitz, Charles R. Dyer
LICS
2012
IEEE
12 years 1 months ago
The Complete Proof Theory of Hybrid Systems
—Hybrid systems are a fusion of continuous dynamical systems and discrete dynamical systems. They freely combine dynamical features from both worlds. For that reason, it has ofte...
André Platzer
CADE
2005
Springer
14 years 11 months ago
The Decidability of the First-Order Theory of Knuth-Bendix Order
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
Ting Zhang, Henny B. Sipma, Zohar Manna
ITP
2010
156views Mathematics» more  ITP 2010»
14 years 2 months ago
The Optimal Fixed Point Combinator
In this paper, we develop a general theory of fixed point combinators, in higher-order logic equipped with Hilbert’s epsilon operator. This combinator allows for a direct and e...
Arthur Charguéraud
ITP
2010
172views Mathematics» more  ITP 2010»
14 years 2 months ago
Equations: A Dependent Pattern-Matching Compiler
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...
Matthieu Sozeau