Sciweavers

485 search results - page 2 / 97
» Weighted Factorization
Sort
View
ICASSP
2009
IEEE
13 years 3 months ago
Weighted nonnegative matrix factorization
Nonnegative matrix factorization (NMF) is a widely-used method for low-rank approximation (LRA) of a nonnegative matrix (matrix with only nonnegative entries), where nonnegativity...
Yong-Deok Kim, Seungjin Choi
CCCG
2008
13 years 6 months ago
Computing the Stretch Factor of Paths, Trees, and Cycles in Weighted Fixed Orientation Metrics
Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...
Christian Wulff-Nilsen
ICIP
2000
IEEE
14 years 6 months ago
Weighted Factorization
Factorization methods use linear subspace constraints to recover 3D rigid structure from 2D motion. Usually, these methods give equal weight to the contribution of each region (or...
Pedro M. Q. Aguiar, José M. F. Moura
CVPR
2001
IEEE
14 years 7 months ago
A Weighted Non-Negative Matrix Factorization for Local Representations
This paper presents an improvement of the classical Non-negative Matrix Factorization (NMF) approach, for dealing with local representations of image objects. NMF, when applied to...
David Guillamet, Jordi Vitrià, Marco Bressa...
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
13 years 9 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...