1453 search results - page 138 / 291 » Partial Constraint Satisfaction |
130
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
127
click to vote
TIT
2008
15 years 4 months ago
2008
Abstract--In this paper, the Lagrangian formulation of variablerate vector quantization is extended to quantization with simultaneous constraints on entropy and codebook size, incl...
169
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as...
149
click to vote
CC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...
146
click to vote
TIT
2010
14 years 11 months ago
2010
We consider the capacity of a wideband fading channel with partial feedback, subject to an average power constraint. A doubly block Rayleigh fading model is assumed with finite co...