1058 search results - page 36 / 212 » It's Doomed; We Can Prove It |
CCCG
2007
15 years 1 months ago
2007
Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edg...
DAM
2007
14 years 11 months ago
2007
We show that the logical theory QLA proves the Cayley–Hamilton theorem from the Steinitz exchange theorem together with a strengthening of the linear independence principle. Sin...
ENTCS
2007
14 years 11 months ago
2007
We present a method for pipeline verification using SMT solvers. It is based on a non-deterministic “mother pipeline” machine (MOP) that abstracts the instruction set archite...
ORDER
2000
14 years 11 months ago
2000
We prove that, given a nontrivial Boolean algebra B, a compact convex set S and a group G, there is an orthomodular lattice L with the center isomorphic to B, the automorphism grou...
129
click to vote
JMLR
2012
13 years 2 months ago
2012
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...