Sciweavers

1058 search results - page 36 / 212
» It's Doomed; We Can Prove It
Sort
View
CCCG
2007
13 years 11 months ago
On the Fewest Nets Problem for Convex Polyhedra
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...
Val Pinciu
DAM
2007
83views more  DAM 2007»
13 years 9 months ago
The proof theoretic strength of the Steinitz exchange theorem
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...
Michael Soltys
ENTCS
2007
88views more  ENTCS 2007»
13 years 9 months ago
Mothers of Pipelines
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...
Sava Krstic, Robert B. Jones, John O'Leary
ORDER
2000
82views more  ORDER 2000»
13 years 9 months ago
Embeddings into Orthomodular Lattices with Given Centers, State Spaces and Automorphism Groups
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...
John Harding, Mirko Navara
JMLR
2012
12 years 10 days ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
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...
Eftychios A. Pnevmatikakis, Liam Paninski