3591 search results - page 273 / 719 » Typing linear constraints |
208
click to vote
TRECVID
2007
15 years 8 months ago
2007
In this paper, we describe our approach and results for high-level feature extraction task at TRECVID 2007. This year, we adopted late fusion of several types of features. As a ï¬...
174
click to vote
ENTCS
2008
15 years 7 months ago
2008
CLF (the Concurrent Logical Framework) is a language for specifying and reasoning about concurrent systems. Its most significant feature is the first-class representation of concu...
184
click to vote
NA
2008
15 years 7 months ago
2008
A number of useful bivariate spline methods are global in nature, i.e., all of the coefficients of an approximating spline must be computed at one time. Typically this involves sol...
216
click to vote
LICS
1994
IEEE
15 years 11 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
211
click to vote
JAR
2010
15 years 5 months ago
2010
Meta-logics and type systems based on intuitionistic logic are commonly used for specifying natural deduction proof systems. We shall show here that linear logic can be used as a m...