4850 search results - page 44 / 970 » Proof and Computation in Geometry |
197
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
163
click to vote
TLCA
1993
Springer
15 years 10 months ago
1993
Springer
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...
162
click to vote
ICPR
2008
IEEE
16 years 19 days ago
2008
IEEE
The multiple view geometry in space-time can represent multiple view geometry in the case where nonrigid arbitrary motions are viewed from multiple translational cameras. However,...