3228 search results - page 216 / 646 » Computationally Sound Proofs |
171
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We address the problem of object-based visual attention from a Bayesian standpoint. We contend with the issue of joint segmentation and saliency computation suitable to provide a ...
214
click to vote
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper, we have developed an operational semantic framework for a non-trival subset of Verilog which features event–driven computation, shared variable concurrency. The b...
177
click to vote
TLCA
2001
Springer
15 years 11 months ago
2001
Springer
Using methods drawn from Game Semantics, we build a sound and computationally adequate model of a simple calculus that includes both subtyping and recursive types. Our model solves...
168
click to vote
TLCA
2009
Springer
16 years 1 months ago
2009
Springer
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...
159
click to vote
HUMO
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. This paper introduces a hand tracking system with a theoretical proof of convergence. The tracking system follows a model-based approach and uses image-based cues, namely...