1717 search results - page 167 / 344 » A Computable Spectral Theorem |
197
click to vote
AGP
1995
IEEE
15 years 10 months ago
1995
IEEE
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
189
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
201
click to vote
JACM
2002
15 years 6 months ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
163
click to vote
ECCC
2007
15 years 6 months ago
2007
We prove space hierarchy and separation results for randomized and other semantic models of computation with advice where a machine is only required to behave appropriately when g...
152
click to vote
ISVC
2007
Springer
16 years 17 days ago
2007
Springer
Shape from texture has received much attention in the past few decades. We propose a computationally efficient method to extract the 3D shape of developable surfaces from the spect...