Sciweavers

561 search results - page 38 / 113
» Algorithms and applications for approximate nonnegative matr...
Sort
View
ICONIP
2007
13 years 9 months ago
Flexible Component Analysis for Sparse, Smooth, Nonnegative Coding or Representation
In the paper, we present a new approach to multi-way Blind Source Separation (BSS) and corresponding 3D tensor factorization that has many potential applications in neuroscience an...
Andrzej Cichocki, Anh Huy Phan, Rafal Zdunek, Liqi...
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 10 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
14 years 2 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
ICASSP
2009
IEEE
14 years 2 months ago
Complex NMF: A new sparse representation for acoustic signals
This paper presents a new sparse representation for acoustic signals which is based on a mixing model defined in the complex-spectrum domain (where additivity holds), and allows ...
Hirokazu Kameoka, Nobutaka Ono, Kunio Kashino, Shi...
WWW
2005
ACM
14 years 8 months ago
PageRank as a function of the damping factor
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
Paolo Boldi, Massimo Santini, Sebastiano Vigna