1011 search results - page 15 / 203 » The three dimensions of proofs |
COMPGEOM
1995
ACM
15 years 1 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
104
click to vote
TPHOL
1999
IEEE
15 years 2 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
DCG
2008
14 years 9 months ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
EJC
2007
14 years 9 months ago
2007
COLING
2008
14 years 11 months ago
2008
In this paper, an extension of a dimensionality reduction algorithm called NONNEGATIVE MATRIX FACTORIZATION is presented that combines both `bag of words' data and syntactic ...