1968 search results - page 18 / 394 » The Complexity of Valued Constraint Models |
CONSTRAINTS
2008
13 years 8 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...
ENDM
2000
13 years 8 months ago
2000
Both parametric design tasks and analysis tasks of technical systems have a similar problem setting: The structure of the system to be configured or analyzed is defined already. W...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
Lambert's model is widely used in low level computer vision algorithms such as matching, tracking or optical flow computation for example. However, it is well known that thes...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
This paper addresses the problem of identifying the value of information held by a teammate on a distributed, multi-agent team. It focuses on a distributed scheduling task in whic...
ICIP
2008
IEEE
14 years 10 months ago
2008
IEEE
Abstract-- Complexity modeling of spatial-temporal compensations in H.264/AVC decoding is performed by examining a rich set of inter- and intra-prediction modes. Specifically, we s...