3591 search results - page 160 / 719 » Typing linear constraints |
152
click to vote
ANOR
2008
15 years 7 months ago
2008
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...
149
click to vote
ENTCS
2002
15 years 6 months ago
2002
We present a variant of the linear logical framework LLF that avoids the restriction l-typed terms be in pre-canonical form and adds -abstraction at the level of families. We aban...
169
click to vote
LISP
2002
15 years 6 months ago
2002
Security-typed languages enforce secrecy or integrity policies by type-checking. This paper investigates continuation-passing style (CPS) as a means of proving that such languages...
205
click to vote
CONSTRAINTS
2008
15 years 7 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
194
click to vote
ICMCS
2006
IEEE
16 years 1 months ago
2006
IEEE
Different denoising schemes show dissimilar types of artifacts. For example, certain transform-based denoising schemes could introduce artifacts in smooth regions while others eli...