2109 search results - page 38 / 422 » Solving Necklace Constraint Problems |
145
click to vote
JMLR
2012
13 years 6 months ago
2012
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
152
Voted
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
154
click to vote
IJCAI
1989
15 years 5 months ago
1989
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de sign task takes as input the specifications of the desired functions of a device...
139
click to vote
AAAI
2000
15 years 5 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
118
click to vote
MMAS
2010
Springer
14 years 11 months ago
2010
Springer
The two-dimensional layout optimization problem reinforced by the efficient space utilization demand has a wide spectrum of practical applications. Formulating the problem as a non...