1055 search results - page 81 / 211 » Convex Factorization Machines |
102
click to vote
TIT
2010
14 years 7 months ago
2010
Belief propagation is shown to be an instance of a hybrid between two projection algorithms in the convex programming literature: Dykstra's algorithm with cyclic Bregman proje...
81
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Frame (upper and lower) bound ratio is a key factor of numerical stability of frame systems. While tight frames, of which the minimal ratio 1 is achieved, are much preferred in ma...
151
Voted
CORR
2012
Springer
13 years 8 months ago
2012
Springer
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
77
Voted
DATE
2000
IEEE
15 years 5 months ago
2000
IEEE
In this paper we address the problem of designing very high throughput finite state machines (FSMs). The presence of loops in sequential circuits prevents a straightforward and g...
75
Voted
NIPS
1998
15 years 1 months ago
1998
The W-S (Wake-Sleep) algorithm is a simple learning rule for the models with hidden variables. It is shown that this algorithm can be applied to a factor analysis model which is a...