Sciweavers

139 search results - page 12 / 28
» A Singular Value Thresholding Algorithm for Matrix Completio...
Sort
View
AMDO
2004
Springer
13 years 11 months ago
On-the-Fly Training
Abstract. A new algorithm for the incremental learning and non-intrusive tracking of the appearance of a previously non-seen face is presented. The computation is done in a causal ...
Javier Melenchón, Lourdes Meler, Ignasi Iri...
IMC
2004
ACM
14 years 1 months ago
Modeling distances in large-scale networks by matrix factorization
In this paper, we propose a model for representing and predicting distances in large-scale networks by matrix factorization. The model is useful for network distance sensitive app...
Yun Mao, Lawrence K. Saul
FOCM
2010
108views more  FOCM 2010»
13 years 6 months ago
Iterative Thresholding Meets Free-Discontinuity Problems
Free-discontinuity problems describe situations where the solution of interest is defined by a function and a lower dimensional set consisting of the discontinuities of the funct...
Massimo Fornasier, Rachel Ward
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
14 years 8 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
ESA
2007
Springer
155views Algorithms» more  ESA 2007»
13 years 11 months ago
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
Laurent Dupont, Michael Hemmer, Sylvain Petitjean,...