2646 search results - page 144 / 530 » Local Type Inference |
151
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Many problems in mathematics and computer science can be reduced to proving the satisfiability of conjunctions of literals in a background theory which is often the extension of a ...
126
click to vote
FOSSACS
2010
Springer
15 years 11 months ago
2010
Springer
Every algebraic theory gives rise to a monad, and monads allow a meta-language which is a basic programming language with sideeffects. Equations in the algebraic theory give rise ...
145
Voted
KI
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
128
Voted
CVPR
2009
IEEE
16 years 2 months ago
2009
IEEE
The aim of this paper is to address the problem of recognizing human group activities in surveillance videos. This task has great potentials in practice, however was rarely studie...
149
click to vote
PAMI
1998
15 years 4 months ago
1998
—This paper concerns an efficient algorithm for learning in the limit a special type of regular languages called strictly locally testable languages from positive data, and its a...