Sciweavers

1786 search results - page 31 / 358
» The Structure of Factor Oracles
Sort
View
94
Voted
ECCV
2010
Springer
15 years 5 months ago
Bilinear factorization via Augmented Lagrange Multipliers
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...
91
Voted
MOC
1998
71views more  MOC 1998»
15 years 11 days ago
Factorizing complex symmetric matrices with positive definite real and imaginary parts
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...
Nicholas J. Higham
99
Voted
PAMI
2002
78views more  PAMI 2002»
15 years 11 days ago
Robust Factorization
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...
Henrik Aanæs, Rune Fisker, Kalle Åstr&...
91
Voted
JMLR
2010
119views more  JMLR 2010»
14 years 7 months ago
The Group Dantzig Selector
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...
Han Liu, Jian Zhang 0003, Xiaoye Jiang, Jun Liu
102
Voted
ARSCOM
2007
82views more  ARSCOM 2007»
15 years 25 days ago
Extremal properties of (1, f)-odd factors in graphs
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...
Qinglin Roger Yu, Zhao Zhang