834 search results - page 59 / 167 » A Decomposition Technique for Max-CSP |
CSMR
2004
IEEE
14 years 1 months ago
2004
IEEE
The recovery of software architecture is a first important step towards re-engineering a software system. Architecture recovery usually involves clustering. The problem with curre...
AAECC
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel...
CVPR
2008
IEEE
15 years 3 days ago
2008
IEEE
This paper examines the problem of extracting lowdimensional manifold structure given millions of highdimensional face images. Specifically, we address the computational challenge...
INFORMS
2000
13 years 10 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
CVPR
2008
IEEE
15 years 3 days ago
2008
IEEE
This paper addresses the limitation of current multilinear techniques (multilinear PCA, multilinear ICA) when applied to face recognition for handling faces in unseen illumination...