719 search results - page 49 / 144 » Solving Sparse Linear Constraints |
116
click to vote
COCO
2011
Springer
13 years 10 months ago
2011
Springer
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
ICCV
2003
IEEE
16 years 18 days ago
2003
IEEE
We present a new approach to 3D scene modeling based on geometric constraints. Contrary to the existing methods, we can quickly obtain 3D scene models that respect the given const...
CVPR
2008
IEEE
16 years 21 days ago
2008
IEEE
To learn a new visual category from few examples, prior knowledge from unlabeled data as well as previous related categories may be useful. We develop a new method for transfer le...
126
click to vote
CPAIOR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
COMPUTING
2007
14 years 10 months ago
2007
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebrai...