663 search results - page 37 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
INFORMS
2010
13 years 5 months ago
2010
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
ICANN
2007
Springer
13 years 11 months ago
2007
Springer
Within the taxonomy of feature extraction methods, recently the Wrapper approaches lost some popularity due to the associated computational burden, compared to Embedded or Filter m...
JAIR
2000
13 years 7 months ago
2000
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
We present a novel algorithm aiming to estimate the 3D shape, the texture of a human face, along with the 3D pose and the light direction from a single photograph by recovering th...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...