This paper presents a unified approach to solve different bilinear factorization problems in Computer Vision in the presence of missing data in the measurements. The problem is f...
Complex symmetric matrices whose real and imaginary parts are positive definite are shown to have a growth factor bounded by 2 for LU factorization. This result adds to the classe...
Factorization algorithms for recovering structure and motion from an image stream have many advantages, but they usually require a set of well tracked features. Such a set is in g...
We introduce a new method -- the group Dantzig selector -- for high dimensional sparse regression with group structure, which has a convincing theory about why utilizing the group...
Let G be a simple graph and f : V (G) → {1, 3, 5, ...} an odd integer valued function defined on V (G). A spanning subgraph F of G is called a (1, f)odd factor if dF (v) ∈ {1...