Sciweavers

46 search results - page 10 / 10
» Applying Local Search to Temporal Reasoning
Sort
View
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
13 years 11 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson