59 search results - page 8 / 12 » A Weighted Non-Negative Matrix Factorization for Local Repre... |
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximat...
SIAMSC
2010
13 years 2 months ago
2010
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
AIPS
2010
13 years 10 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
State of the art methods for image and object re-
trieval exploit both appearance (via visual words) and
local geometry (spatial extent, relative pose). In large
scale problems,...
SIAMJO
2010
13 years 2 months ago
2010
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...