Sciweavers

8669 search results - page 213 / 1734
» Computing matrix representations
Sort
View
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 9 months ago
Penalty Decomposition Methods for Rank Minimization
In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first show that a class of matrix optimization prob...
Zhaosong Lu, Yong Zhang
JSAC
2008
143views more  JSAC 2008»
13 years 9 months ago
Distributed Kalman filtering based on consensus strategies
In this paper, we consider the problem of estimating the state of a dynamical system from distributed noisy measurements. Each agent constructs a local estimate based on its own m...
Ruggero Carli, Alessandro Chiuso, Luca Schenato, S...
JSAC
2006
89views more  JSAC 2006»
13 years 9 months ago
Robust multiuser detection for multicarrier CDMA systems
Abstract--Multiuser detection (MUD) for code-division multiple-access (CDMA) systems usually relies on some a priori channel estimates, which are obtained either blindly or by usin...
Rensheng Wang, Hongbin Li, Tao Li
PR
2006
108views more  PR 2006»
13 years 9 months ago
Boosted discriminant projections for nearest neighbor classification
In this paper we introduce a new embedding technique to find the linear projection that best projects labeled data samples into a new space where the performance of a Nearest Neig...
David Masip, Jordi Vitrià
TKDE
2008
126views more  TKDE 2008»
13 years 9 months ago
The Discrete Basis Problem
Matrix decomposition methods represent a data matrix as a product of two smaller matrices: one containing basis vectors that represent meaningful concepts in the data, and another ...
Pauli Miettinen, Taneli Mielikäinen, Aristide...