Sciweavers

1068 search results - page 19 / 214
» Factorization as a Rank 1 Problem
Sort
View
COCOON
2003
Springer
15 years 2 months ago
Randomized Approximation of the Stable Marriage Problem
Abstract. While the original stable marriage problem requires all participants to rank all members of the opposite sex in a strict order, two natural variations are to allow for in...
Magnús M. Halldórsson, Kazuo Iwama, ...
CISS
2008
IEEE
15 years 4 months ago
1-Bit compressive sensing
Abstract—Compressive sensing is a new signal acquisition technology with the potential to reduce the number of measurements required to acquire signals that are sparse or compres...
Petros Boufounos, Richard G. Baraniuk
SIAMSC
2008
167views more  SIAMSC 2008»
14 years 9 months ago
Low-Dimensional Polytope Approximation and Its Applications to Nonnegative Matrix Factorization
In this study, nonnegative matrix factorization is recast as the problem of approximating a polytope on the probability simplex by another polytope with fewer facets. Working on th...
Moody T. Chu, Matthew M. Lin
CVPR
2012
IEEE
13 years 3 days ago
A simple prior-free method for non-rigid structure-from-motion factorization
This paper proposes a simple “prior-free” method for solving non-rigid structure-from-motion factorization problems. Other than using the basic low-rank condition, our method ...
Yuchao Dai, Hongdong Li, Mingyi He
80
Voted
JUCS
2008
124views more  JUCS 2008»
14 years 9 months ago
Query Transformation Based on Semantic Centrality in Semantic Social Network1
: Query transformation is a serious hurdle on semantic peer-to-peer environment. For interoperability between peers, queries sent from a source peer have to be efficiently transfor...
Jason J. Jung