Sciweavers

1068 search results - page 2 / 214
» Factorization as a Rank 1 Problem
Sort
View
CSDA
2010
132views more  CSDA 2010»
13 years 5 months ago
Approximate low-rank factorization with structured factors
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
Ivan Markovsky, Mahesan Niranjan
TSP
2008
110views more  TSP 2008»
13 years 4 months ago
Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-(1, L, L) Terms
In this paper, we present a powerful technique for the blind extraction of direct-sequence code-division multiple access (DS-CDMA) signals from convolutive mixtures received by an ...
Lieven De Lathauwer, Alexandre de Baynast
ICML
2005
IEEE
14 years 6 months ago
Non-negative tensor factorization with applications to statistics and computer vision
We derive algorithms for finding a nonnegative n-dimensional tensor factorization (n-NTF) which includes the non-negative matrix factorization (NMF) as a particular case when n = ...
Amnon Shashua, Tamir Hazan
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
14 years 4 days ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid
CORR
2007
Springer
112views Education» more  CORR 2007»
13 years 5 months ago
Enumerating the Nash equilibria of rank 1-games
A bimatrix game (A, B) is called a game of rank k if the rank of the matrix A + B is at most k. We consider the problem of enumerating the Nash equilibria in
Thorsten Theobald