143 search results - page 23 / 29 » Subgradient methods and consensus algorithms for solving con... |
GD
2005
Springer
14 years 28 days ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
ICCV
2009
IEEE
15 years 12 days ago
2009
IEEE
In this paper we propose an algorithm to estimate missing
values in tensors of visual data. The values can be missing
due to problems in the acquisition process, or because
the ...
NIPS
2007
13 years 8 months ago
2007
When we have several related tasks, solving them simultaneously is shown to be more effective than solving them individually. This approach is called multi-task learning (MTL) and...
ICCV
2009
IEEE
15 years 12 days ago
2009
IEEE
Supervised learning of a parts-based model can be for-
mulated as an optimization problem with a large (exponen-
tial in the number of parts) set of constraints. We show how
thi...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper, a new adaptive beamforming algorithm with joint robustness against covariance matrix uncertainty as well as steering vector mismatch is proposed. First, the theoret...