1115 search results - page 134 / 223 » An Abstract Look at Realizability |
171
click to vote
TPCD
1994
15 years 5 months ago
1994
Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating di erent f abstraction. In this paper we show how a non-...
110
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract. One of the key challenge in social behavior analysis is to automatically discover the subset of features relevant to a specific social signal (e.g., backchannel feedback...
159
click to vote
AAECC
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
151
click to vote
ARC
2010
Springer
15 years 4 months ago
2010
Springer
: System identification is the art and science of building mathematical models of dynamic systems from observed input-output data. It can be seen as the interface between the real ...
138
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts ...