Sciweavers

1258 search results - page 113 / 252
» Architecture-driven Problem Decomposition
Sort
View
ICASSP
2011
IEEE
13 years 24 days ago
Novel hierarchical ALS algorithm for nonnegative tensor factorization
The multiplicative algorithms are well-known for nonnegative matrix and tensor factorizations. The ALS algorithm for canonical decomposition (CP) has been proved as a “workhorse...
Anh Huy Phan, Andrzej Cichocki, Kiyotoshi Matsuoka...
ICASSP
2011
IEEE
13 years 24 days ago
Fast damped gauss-newton algorithm for sparse and nonnegative tensor factorization
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
Anh Huy Phan, Petr Tichavský, Andrzej Cicho...
ICASSP
2011
IEEE
13 years 24 days ago
Sparse common spatial patterns in brain computer interface applications
The Common Spatial Pattern (CSP) method is a powerful technique for feature extraction from multichannel neural activity and widely used in brain computer interface (BCI) applicat...
Fikri Goksu, Nuri Firat Ince, Ahmed H. Tewfik
PAMI
2012
12 years 20 days ago
Simultaneous Video Stabilization and Moving Object Detection in Turbulence
Turbulence mitigation refers to the stabilization of videos with non-uniform deformations due to the influence of optical turbulence. Typical approaches for turbulence mitigation ...
Omar Oreifej, Xin Li, and Mubarak Shah
SDM
2012
SIAM
233views Data Mining» more  SDM 2012»
11 years 11 months ago
On Finding Joint Subspace Boolean Matrix Factorizations
Finding latent factors of the data using matrix factorizations is a tried-and-tested approach in data mining. But finding shared factors over multiple matrices is more novel prob...
Pauli Miettinen