171 search results - page 15 / 35 » Convex Sparse Matrix Factorizations |
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
135
click to vote
CVPR
2012
IEEE
13 years 4 days ago
2012
IEEE
We consider the problem of finding a few representatives for a dataset, i.e., a subset of data points that efficiently describes the entire dataset. We assume that each data poi...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper presents a novel time-adaptive estimation technique by revisiting the classical Wiener-Hopf equation. Any convex and not necessarily differentiable function can be used...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
100
click to vote
LCPC
1998
Springer
15 years 1 months ago
1998
Springer
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...