663 search results - page 91 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
COR
2010
13 years 7 months ago
2010
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...
EOR
2006
13 years 7 months ago
2006
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
IJCV
2006
13 years 7 months ago
2006
We present a novel framework for motion segmentation that combines the concepts of layer-based methods and feature-based motion estimation. We estimate the initial correspondences...
ISTCS
1997
Springer
13 years 11 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...