1381 search results - page 170 / 277 » Computational Complexity of Constraint Satisfaction |
129
click to vote
HIPC
2004
Springer
15 years 9 months ago
2004
Springer
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
123
click to vote
ICIP
2009
IEEE
15 years 1 months ago
2009
IEEE
Motion estimation (ME) methods based on differential techniques provide useful information for video analysis, and moreover it is relatively easy to embed into them regularity con...
156
click to vote
ICCV
2011
IEEE
14 years 4 months ago
2011
IEEE
Non-rigid structure from motion (NRSFM) is a difficult, underconstrained problem in computer vision. The standard approach in NRSFM constrains 3D shape deformation using a linear...
138
Voted
IVC
2006
15 years 4 months ago
2006
While the SoftAssign algorithm imposes a two-way constraint embedded into the deterministic annealing scheme and the EMICP algorithm imposes a one-way constraint, they represent t...
146
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...