14518 search results - page 139 / 2904 » Two Problems for Sophistication |
ASPDAC
2001
ACM
14 years 2 months ago
2001
ACM
Abstract- Traditional state-traversal-basedmethods for verifying sequential circuits are computationally infeasible for circuits with a large number of memory elements. However, if...
BMVC
1997
13 years 11 months ago
1997
A new geometrical approach in solving the shape from shading problem of Lambertian model is discussed. It is shown that this problem is bound by two local constraints through the ...
STOC
1997
ACM
14 years 2 months ago
1997
ACM
This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:
JSYML
2008
13 years 10 months ago
2008
Some 40 years ago, Dana Scott proved that every countable Scott set is the standard system of a model of PA. Two decades later, Knight and
SLOGICA
2008
13 years 10 months ago
2008
We discuss two objections that foundationalists have raised against infinite chains of probabilistic justification. We demonstrate that neither of the objections can be maintained....