4850 search results - page 236 / 970 » Proof and Computation in Geometry |
133
click to vote
DCG
2008
15 years 6 months ago
2008
Abstract. We reformulate a known characterization of decomposability of polytopes in a way which may be more computationally convenient, and offer a more transparent proof. We appl...
168
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory a...
151
click to vote
COMBINATORICS
1998
15 years 6 months ago
1998
Based on a recent improvement of the inclusion-exclusion principle, we present a new approach to network reliability problems. In particular, we give a new proof of a result of Sh...
213
click to vote
FSTTCS
2005
Springer
16 years 4 days ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
164
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
We present a passive computer vision method that exploits existing mapping and navigation databases in order to automatically create 3D building models. Our method defines a gramm...