4850 search results - page 44 / 970 » Proof and Computation in Geometry |
CGA
1998
14 years 10 months ago
1998
111
click to vote
STOC
2004
ACM
15 years 11 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, ...
TLCA
1993
Springer
15 years 3 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...
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
ICPR
2008
IEEE
15 years 5 months 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,...